There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 16

Record: found
Abstract: not found
Book Chapter: not found

Languages, Automata, and Logic

Wolfgang Thomas (1997)

0 comments Cited 147 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Infinite games on finitely coloured graphs with applications to automata on infinite trees

Wieslaw Zielonka (1998)

0 comments Cited 93 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Decidability of Second-Order Theories and Automata on Infinite Trees

Michael O. Rabin (1969)

0 comments Cited 65 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Pages: 398-409

DOI: 10.1007/978-3-540-70583-3_33

SO-VID: 2b8043e9-3957-43f9-9163-a29c5a1d9524

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 5

Weak MSO with the Unbounding Quantifier
Authors: Mikołaj Bojanczyk
On the Decidability of MSO+U on Infinite Trees
Authors: Mikołaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski …
R-Automata
Authors: Parosh Aziz Abdulla, Pavel Krcal, Wang Yi

See all cited by

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata

Read this book at

Related collections

2021 Research and Innovation Open Distance and eLearning Virtual Conference

Most cited references 16

Languages, Automata, and Logic

Infinite games on finitely coloured graphs with applications to automata on infinite trees

Decidability of Second-Order Theories and Automata on Infinite Trees

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 6,998

Cited by 5