When is context-freeness distinguishable from regularity? An extension of Parikh's theorem

DOI10.1007/978-3-031-40247-0_12OpenAlexW4385705545MaRDI QIDQ6199872

Hiroyuki Seki, Yusuke Inoue, Kenji Hashimoto

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_12

zbMATH Keywords

Parikh's theoremfinite monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• A simplified proof of Parikh's theorem
• Parikh's theorem: a simple and direct automaton construction
• A toolkit for Parikh matrices
• A generalization of Parikh's semilinear theorem
• A sharpening of the Parikh mapping
• Commutative Regular Equations and Parikh's Theorem
• Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars
• On Context-Free Languages

This page was built for publication: When is context-freeness distinguishable from regularity? An extension of Parikh's theorem