# Automata Theory on Trees and Partial Orders

@inproceedings{Thomas1997AutomataTO, title={Automata Theory on Trees and Partial Orders}, author={Wolfgang Thomas}, booktitle={TAPSOFT}, year={1997} }

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…

## 38 Citations

Automata on DAG representations of finite trees

- Computer Science
- 1999

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

- Computer Science, MathematicsICGT
- 2006

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

- Computer ScienceFCT
- 2005

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

- Computer ScienceDevelopments 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

- Computer Science, MathematicsCSR
- 2020

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

- Computer Science
- 2001

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

- Computer ScienceJISBD
- 2006

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

- Computer ScienceArXiv
- 2018

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

- MathematicsDiscret. Math. Theor. Comput. Sci.
- 1999

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)

- Computer Science
- 2005

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.

## References

SHOWING 1-10 OF 38 REFERENCES

Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs

- Computer ScienceInf. Control.
- 1981

NONDETERMINISM VERSUS DETERMINISM OF FINITE AUTOMATA OVER DIRECTED ACYCLIC GRAPHS

- Computer Science
- 1994

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

- Mathematics, Computer ScienceInf. Comput.
- 1995

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

- Computer Science, MathematicsProceedings 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

- Mathematics, Computer ScienceJ. Comput. Syst. Sci.
- 1970

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems

- Computer ScienceInf. Comput.
- 1996

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

- Mathematics
- 1968

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.

- Mathematics
- 1969

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 Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs

- Mathematics, Computer ScienceInf. Comput.
- 1990

The Monadic Quantiier Alternation Hierarchy over Graphs Is Innnite

- Mathematics
- 1998

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…