论文信息 - Locally Threshold Testable Languages of Infinite Words

Locally Threshold Testable Languages of Infinite Words

The class of finitely locally threshold testable ω-languages is proved to be decidable relatively to the class of all regular ω-languages. We apply this to the monadic second order theory of infinite word structures with successor function: it is decidable whether for a given monadic second-order formula there exists a first-order formula with the same set of infinite word models.

Thomas Wilke | T. Wilke

[1] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2] Thomas Wilke,et al. An Algebraic Theory for Regular Languages of Finite and Infinite Words , 1993, Int. J. Algebra Comput..

[3] Wolfgang Thomas,et al. Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[4] Janusz A. Brzozowski,et al. Characterizations of locally testable events , 1973, Discret. Math..

[5] Ludwig Staiger,et al. Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen , 1974, J. Inf. Process. Cybern..

[6] J. R. Büchi. On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[7] S. Sieber. On a decision method in restricted second-order arithmetic , 1960 .