A generalization of Parikh's semilinear theorem

DOI10.1016/0012-365X(72)90013-1zbMath0251.68043MaRDI QIDQ2557125

Sheila A. Greibach

Publication date: 1972

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

On Grammars Controlled by Parikh Vectors ⋮ Parikh's theorem: a simple and direct automaton construction ⋮ When is context-freeness distinguishable from regularity? An extension of Parikh's theorem ⋮ Commutative grammars ⋮ Iterating iterated substitution ⋮ A simplified proof of Parikh's theorem ⋮ Classes of formal grammars

Cites Work

• On Context-Free Languages
• Full AFLs and nested iterated substitution
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of Parikh's semilinear theorem