Abstract
The paper reviews recent results which aim at generalizing finite automata theory from words and trees to labelled partial orders (presented as labelled directed acyclic graphs), with an emphasis on logical aspects. As an important type of labelled partial order we consider pictures (two-dimensional words). Graph acceptors and their specialization for pictures, “tiling systems”, are presented, and their equivalence to existential monadic second-order logic is reviewed. Other restricted versions of graph acceptors are discussed, and an intuitive exposition of the recently established monadic quantifier alternation hierarchy over graphs is given.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F. Bossut, M. Dauchet, B. Warin, A Kleene Theorem for a class of planar acyclic graphs, Inform. and Comput. 117 (1995), 251–265.
J.R. Büchi, On a decision method in restricted second-order arithmetic, in: Proc. 1960 Int. Congr. for Logic, Methodology, and Philosophy of Science, Stanford Univ. Press, Stanford 1962, pp. 1–11.
B. Courcelle, The monadic second-order theory of graphs II: Infinite graphs of bounded width, Math. Syst. Theory 21 (1989), 187–221.
B. Courcelle, The monadic second-order logic of graphs I: recognizable sets of finite graphs Inform. and Comput. 85 (1990), 12–75.
B. Courcelle, The expression of graph properties and graph transformations in monadic secodn-order logic, in: Handbook of Graph Transformations, Vol. I: Foundations (G. Rozenberg, Ed.), World Scientific, Singapore 1996.
J. Doner, Tree acceptors and some of their applications, J. Comput. System Sci. 4 (1970), 406–451.
V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore 1995.
H.D. Ebbinghaus, J. Flum, Finite Model Theory, Springer-Verlag New York 1995.
R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: Complexity and Computation (R. Karp, Ed.), SIAM-AMS Proceedings 7 (1974), pp. 43–73.
R. Fagin, Monadic generalized spectra, Z. math. Logik u. Grundl. Math. 21 (1975), 123–134.
R. Fagin, L.J. Stockmeyer, M.Y. Vardi, On monadic NP versus monadic co-NP, Information and Computation 120 (1995), 78–92.
D. Giammarresi, A. Restivo, Two-dimensional languages, in: Handbook of Formal Language Theory, Vol. III (G. Rozenberg, A. Salomaa, Eds.), Springer-Verlag, New York (to appear).
D. Giammarresi, A. Restivo, S. Seibert, W. Thomas, Monadic second-order logic over rectangular pictures and recognizability by tiling systems, Information and Computation 125 (1996), 32–45.
F. Gécseg, M. Steinby, Tree Automata, Akadémiai Kiodó, Budapest 1984.
K. Inoue, A. Nakamura, Some properties of two-dimensional tessellation acceptors, Inform. Sci. 13 (1977), 95–121.
T. Kamimura, G. Slutzki, Parallel and two-way automata on directed ordered acyclic graphs, Inform. Contr. 49 (1981), 10–51.
M. Latteux, D. Simplot, Context-sensitive languages and recognizable picture languages, Tech. Rep. IT-96-298, L.I.F.L., University of Lille 1.
O. Matz, W. Thomas, The monadic quantifier alternation hierarchy over graphs is infinite, manuscript, Univ. of Kiel, 1996 (submitted).
A. Potthoff, S. Seibert, W. Thomas, Nondeterminism versus determinism of finite automata over directed acyclic graphs, Bull. Belg. Math. Soc. Simon Stevin 1 (1994), 285–298.
M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.
D. Seese, Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees, in: Tree Automata and Languages (M. Nivat, A. Podelski, Eds.), Elsevier, 1992, pp. 83–114.
H. Sperber, Idealautomaten, Dissertation, Univ. Erlangen-Nürnberg, 1985.
H. Sperber, Finite automata accepting animals and lower sets, in: Sém. Lotharingien et Combinatoire (G. Nicoletti, ed.), Publ. Inst. Rech. Math. Avancée 316/S-13 (1986), Univ. Strasbourg, Dép. de Math., pp. 107–112.
W. Thomas, On logics, tilings, and automata, in: Automata, Languages, and Programming (J. Leach et al., Eds.), Lecture Notes in Computer Science 510, Springer-Verlag, Berlin 1991, pp. 441–453.
W. Thomas, Languages, automata and logic, in: Handbook of Formal Language Theory, Vol. III (G. Rozenberg, A. Salomaa, Eds.), Springer-Verlag, New York (to appear).
W. Thomas, Elements of an automata theory over partial orders, in: Proc. Workshop on Partial Order Methods in Verification (D. Peled, Ed.), DIMACS Ser. in Discr. Math. (to appear).
J.W. Thatcher, J.B. Wright, Generalized finite automata with an application to a decision problem of second order logic, Math. Syst. Theory 2 (1968), 57–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomas, W. (1997). Automata theory on trees and partial orders. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030586
Download citation
DOI: https://doi.org/10.1007/BFb0030586
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive