Automata Theory on Trees and Partial Orders

  title={Automata Theory on Trees and Partial Orders},
  author={Wolfgang Thomas},
  • W. Thomas
  • Published in TAPSOFT 14 April 1997
  • Computer Science
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… 
Automata on DAG representations of finite trees
It is proved that the emptiness problem for this class of automata is NP-complete and the decidability of directional type checking for logic programs is proved, which improves earlier results by Aiken and Lakshman.
Automata on Directed Graphs: Edge Versus Vertex Marking
This work implies that every MSO-definable tree language can be recognised by E-automata with uniform runs, that is, runs that do not distinguish between isomorphic subtrees.
On the Expressiveness of Asynchronous Cellular Automata
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the existential
Finite Automata on Unranked and Unordered DAGs
  • L. Priese
  • Computer Science
    Developments in Language Theory
  • 2007
We introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and nondeterministic automata operating on them. Those dag automata are a conservative
Second-Order Finite Automata
It is shown that sets of sets of strings represented by second-order finite automata are closed under the usual Boolean operations, such as union, intersection, difference and even under a suitable notion of complementation, and emptiness of intersection and inclusion are decidable.
Automata for Partially Ordered and Partially Reliable Connections
An abstract syntax is deened to specify order and reliability constraints in data ows, and is also used to specify the particular automata which recognise exactly the sets of deliverable streams.
A Calculus and Algebra for Querying Directed Acyclic Graphs
A language for querying directed acyclic graph based on patterns that allows the assignment to variables of portions of a graph that match sub-patterns and shows how the epressions in the language can be translated into a query plan that makes use of an algebra based on the elementary operations of monoid calculus.
Distributed Automata and Logic
This thesis investigates the decidability of the emptiness problem for several classes of nonlocal automata, and shows that the problem isundecidable in general, and finds the problem to be decidable in logspace for a class of forgetful automata.
Local Normal Forms for First-Order Logic with Applications to Games and Automata
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e.
A contribution to formal methods : games, logic and automata. (Contribution aux fondements des méthodes formelles : jeux, logique et automates)
This chapter is a detailed presentation and a generalization of techniques and concepts that have been first used during a collaboration with Walukiewicz and latter extended and partially published by the author himself.


Three types of nite-state graph automata are compared over directed acyclic graphs (where vertices and edges are labelled) and it is shown that deterministic versions are strictly weaker.
A Kleene Theorem for a Class of Planar Acyclic Graphs
A Kleene Theorem is proved linking these two characterizations of sets of graphs, finite automata on graphs and rational expressions that involve union, nondeterministic parallel composition, serial composition, and the iterations of these compositions.
The monadic quantifier alternation hierarchy over graphs is infinite
  • O. MatzW. Thomas
  • Computer Science, Mathematics
    Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
  • 1997
We show that in monadic second-order logic over finite directed graphs, a strict hierarchy of expressiveness is obtained by increasing the (second-order) quantifier alternation depth of formulas.
Tree Acceptors and Some of Their Applications
  • J. Doner
  • Mathematics, Computer Science
    J. Comput. Syst. Sci.
  • 1970
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems
It is shown that a set of pictures is recognized by a finite tiling system iff it is definable in existential monadic second-order logic, which generalizes finite-state recognizability over strings and also matches a natural logic.
Decidability of second-order theories and automata on infinite trees
Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves
Decidability of second-order theories and automata on infinite trees.
Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves
The Monadic Quantiier Alternation Hierarchy over Graphs Is Innnite
We show that the monadic second-order quantiier alternation hierarchy over nite directed graphs and over nite two-dimensional grids is innnite. For this purpose we investigate sets of grids where the