A Chomsky-Like Hierarchy of Infinite Graphs

We consider a strict four-level hierarchy of graphs closely related to the Chomsky hierarchy of formal languages. We provide a uniform presentation of the four families by means of string rewriting.

[1]  Jean Berstel,et al.  Context-Free Languages and Pushdown Automata , 1997, Handbook of Formal Languages.

[2]  Arto Salomaa,et al.  Aspects of Classical Language Theory , 1997, Handbook of Formal Languages.

[3]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

[4]  Teodor Knapik,et al.  A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs , 1998, FSTTCS.

[5]  Wolfgang Thomas,et al.  A Short Introduction to Infinite Automata , 2001, Developments in Language Theory.

[6]  Étienne Payet.  Produit Synchronisé pour Quelques Classes de Graphes Infinis , 2000 .

[7]  Didier Caucal,et al.  On infinite transition graphs having a decidable monadic theory , 1996, Theor. Comput. Sci..

[8]  Étienne Payet,et al.  Thue Specifications, Infinite Graphs and Synchronized Product , 2000, Fundam. Informaticae.

[9]  Colin Stirling,et al.  Rational Graphs Trace Context-Sensitive Languages , 2001, MFCS.

[10]  Marcel Paul Schützenberger,et al.  On Context-Free Languages and Push-Down Automata , 1963, Inf. Control..

[11]  Christophe Morvan,et al.  On Rational Graphs , 2000, FoSSaCS.

[12]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[13]  Didier Caucal,et al.  On the transition graphs of turing machines , 2001, Theor. Comput. Sci..

[14]  J. R. Büchi.  Regular Canonical Systems , 1964 .

[15]  David E. Muller,et al.  Pushdown automata, graphs, ends, second-order logic, and reachability problems , 1981, STOC '81.

[16]  Étienne Payet,et al.  Synchronized Product of Linear Bounded Machines , 1999, FCT.

[17]  Didier Caucal.  On Word Rewriting Systems Having a Rational Derivation , 2000, FoSSaCS.

[18]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.