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 6

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

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

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

Eliminating Recursion in the μ-Calculus

Martin Otto (1999)

0 comments Cited 6 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2000

Publication date (Online): February 18 2002

Pages: 663-674

DOI: 10.1007/3-540-45022-X_56

SO-VID: a6babd8e-6cde-4ea5-843a-6355bf4651a4

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 2

See all cited by

On Deciding if Deterministic Rabin Language Is in Büchi Class

Read this book at

Related collections

Language change

Most cited references 6

Languages, Automata, and Logic

Decidability of Second-Order Theories and Automata on Infinite Trees

Eliminating Recursion in the μ-Calculus

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 6,491

Cited by 2