A Proof of Parikh’s Theorem via Dickson’s Lemma

DOI10.1142/S012905412150009XzbMath1474.68175OpenAlexW3118657126WikidataQ124818868 ScholiaQ124818868MaRDI QIDQ5859679

Toshihiro Koga

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905412150009x

zbMATH Keywords

commutative monoidcontext-free languagesParikh's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• A simplified proof of Parikh's theorem
• Parikh's theorem: a simple and direct automaton construction
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Automated Deduction – CADE-20

This page was built for publication: A Proof of Parikh’s Theorem via Dickson’s Lemma