Parikhʼs theorem: A simple and direct automaton construction

[1]  A. To.  Model Checking Infinite-State Systems: Generic and Specific Approaches , 2010 .

[2]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[3]  J. Conway.  Regular algebra and finite machines , 1971 .

[4]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[5]  Pierre Ganty,et al.  Complexity of pattern-based verification for multithreaded programs , 2011, POPL '11.

[6]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.

[7]  Hans Leiß,et al.  To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm , 2009, Informatica Didact..

[8]  Michael Luttenberger,et al.  Newtonian program analysis , 2010, JACM.

[9]  R. London.  The Maximum Term and the Maximum Real Part of an Entire Function , 1970 .

[10]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[11]  Dexter Kozen,et al.  Parikh's theorem in commutative Kleene algebra , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[12]  D. L. Pilling,et al.  Commutative Regular Equations and Parikh's Theorem , 1973 .

[13]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

[14]  Jan van Leeuwen,et al.  A Generalisation of Parikh's Theorem in Formal Language Theory , 1974, ICALP.

[15]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

[16]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[17]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1997, Fundam. Informaticae.

[18]  Anthony Widjaja Lin,et al.  Parikh Images of Grammars: Complexity and Applications , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[19]  Jonathan Goldstine,et al.  A simplified proof of Parikh's theorem , 1977, Discret. Math..

[20]  Sheila A. Greibach.  A generalization of Parikh's semilinear theorem , 1972, Discret. Math..

[21]  Thomas Schwentick,et al.  On the Complexity of Equational Horn Clauses , 2005, CADE.

[22]  R. M. Dijkstra.  Information Processing Letters , 2003 .

[23]  Luca Aceto,et al.  A Fully Equational Proof of Parikh's Theorem , 2001, RAIRO Theor. Informatics Appl..