Information for "Parikh's theorem"

Basic information

Display title	Parikh's theorem
Default sort key	Parikh's theorem
Page length (in bytes)	10,555
Namespace ID	0
Page ID	252032
Page content language	en - English
Page content model	wikitext
Indexing by robots	Allowed
Number of redirects to this page	0
Counted as a content page	Yes
HandWiki item ID	None

Edit	Allow all users (infinite)
Move	Allow all users (infinite)

Page creator	imported>NBrush
Date of page creation	18:43, 6 February 2024
Latest editor	imported>NBrush
Date of latest edit	18:43, 6 February 2024
Total number of edits	1
Recent number of edits (within past 90 days)	0
Recent number of distinct authors	0

Transcluded templates (33)	Templates used on this page: Template:Category handler (view source) Template:Citation/core (view source) Template:Citation/identifier (view source) Template:Citation/make link (view source) Template:Cite book (view source) Template:Cite journal (view source) Template:Cite web (view source) Template:Clear (view source) Template:Delink (view source) Template:Explain (view source) Template:Fix (view source) Template:Fix/category (view source) Template:Hide in print (view source) Template:Imbox (view source) Template:Math proof (view source) Template:Math theorem (view source) Template:Only in print (view source) Template:Sourceattribution (view source) Module:Arguments (view source) Module:Category handler (view source) Module:Category handler/blacklist (view source) Module:Category handler/config (view source) Module:Category handler/data (view source) Module:Category handler/shared (view source) Module:Delink (view source) Module:Message box (view source) Module:Message box/configuration (view source) Module:Namespace detect/config (view source) Module:Namespace detect/data (view source) Module:No globals (view source) Module:String (view source) Module:Unsubst (view source) Module:Yesno (view source)

Description	Content
Article description: (`description`) This attribute controls the content of the `description` and `og:description` elements.	Parikh's theorem in theoretical computer science says that if one looks only at the number of occurrences of each terminal symbol in a context-free language, without regard to their order, then the language is indistinguishable from a regular language. It is useful for deciding that strings with a given...

Information from Extension:WikiSEO