Decidability of second-order theories and automata on infinite trees

@article{Rabin1968DecidabilityOS,
  title={Decidability of second-order theories and automata on infinite trees},
  author={Michael O. Rabin},
  journal={Bulletin of the American Mathematical Society},
  year={1968},
  volume={74},
  pages={1025-1029}
}
  • M. Rabin
  • Published 1 September 1968
  • Mathematics
  • Bulletin of the American Mathematical Society
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 development of a theory of automata on infinite trees—a chapter in combinatorial mathematics which may be of independent interest. Let £ = {0, 1}, and denote by T the set of all words (finite sequences) on 2. Let r0: T^-T and rx: T—>■ T be, respectively, the successor functions ro(x)=x0 and r1(x… 

A Functional (Monadic) Second-Order Theory of Infinite Trees

A complete axiomatization of Monadic Second-Order Logic over infinite trees is presented, which allows us to uniformly manipulate (hereditarily) finite sets and corresponding labeled trees, and whose language allows for higher abstraction than that of MSO.

Pushdown automata, graphs, ends, second-order logic, and reachability problems

It is shown that the monadic second-order theory of any context-free graph is decidable, and using the results obtained and Rabin's theorem, this work shows that cellular automata and vector addition systems make sense on a very general class of graphs.

Unsafe grammars, panic automata, and decidability

It is shown that the monadic second-order theory of any hyperalgebraic tree, i.e., an infinite tree generated by a higher-order grammar of level 2, is decidable, and the safety restriction from the previous decidability result is removed.

CONTEXT-FREE LANGUAGES, GROUPS, THE THEORY OF ENDS, SECOND-ORDER LOGIC, TILING PROBLEMS, CELLULAR AUTOMATA, AND VECTOR SYSTEMS

It turns out that there exists a surprising connection between certain ideas from the areas listed in the title. In this announcement we try to briefly outline the connection and to state our

The model-theoretic complexity of automatic linear orders

This thesis studies the model-theoretic complexity of automatic linear orders in terms of two complexity measures: the finite-condensation rank and the Ramsey degree.

Finite Automata and Isomorphism Types

It is shown that any automatic structure can be characterised in terms of congruences of nite index of a certain partial, and suggested the development of a ner theory, the theory of structures presented by automata is suggested.

Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems

It turns out that there exists a surprising connection between certain ideas from the areas listed in the title. In this announcement we try to briefly outline the connection and to state our

Chapter 1 Basics on Tree Automata

This chapter exclusively considers finite trees and develops a theory of automata on infinite trees, which serves as a basis for the analysis of specification logics in the context of the verification of state based systems with non-terminating behavior.

Topological Complexity of Sets Defined by Automata and Formulas

By considering in nite structures a variety of complexity measures that come from descriptive set theory, the theory of de nability and the grammatical complexity of their definitions is measured.

Investigations into the Expressiveness of First-order Logic and Weak Path Automata on Infinite Trees

  • Computer Science
  • 2019
Inspired by automata-theoretic characterizations of first-order logic over word structures, the automata classes considered in this thesis are obtained by imposing weak acceptance conditions, antisymmetry of the reachability relation on states, and what the authors call the path condition.
...

References

SHOWING 1-10 OF 21 REFERENCES

A Decision Procedure for the Weak Second Order Theory of Linear Order

Finite Automata and Their Decision Problems

Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.

Decision methods in the theory of ordinals

For an ordinal α, let RS(α), the restricted second order theory of [α, <], be the interpreted formalism containing the first order theory of [α, <] and quantification on monadic predicate variables,

Contributions to the theory of games

The description for this book, Contributions to the Theory of Games (AM-40), Volume IV, will be forthcoming.

The strict determinateness of certain infinite game

Undecidability of Some Topological Theories

Decidability of the theory of relatively complemented distributive lattices and the theory of filters, Algebra

  • i. Logika Sem
  • 1964