Methods via Automata and Bounded Treewidth

Many of the methods we use on graphs are analogs of methods used for languages accepted by finite automata. Because of this, in the next few sections we will give a self-contained account of the aspects of classical formal language theory which we need. We begin with finite automata.

[1]  Ken Thompson,et al.  Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.

[2]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[3]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[4]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[5]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[6]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[9]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[10]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

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

[12]  Dexter Kozen.  On the Myhill-Nerode Theorem for Trees , 1992 .

[13]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[14]  Dexter Kozen,et al.  On Regularity-Preserving Functions , 1995, Bull. EATCS.

[15]  David A. Huffman,et al.  The synthesis of sequential switching circuits , 1954 .

[16]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[17]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[18]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[19]  Ernst L. Leiss.  The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata , 1981, J. Comput. Syst. Sci..

[20]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.