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

Eliminating Recursion in the μ-Calculus

other

Author(s): Martin Otto

Publication date (Online): April 12 2002

Publisher: Springer Berlin Heidelberg

Read this book at

Publisher

Buy book

Bookmark

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 14

Record: found
Abstract: not found
Article: not found

Results on the propositional μ-calculus

Dexter Kozen (1983)

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

Bookmark

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

All references

Author and book information

Book Chapter

Publication date (Print): 1999

Publication date (Online): April 12 2002

Pages: 531-540

DOI: 10.1007/3-540-49116-3_50

SO-VID: 2fe6453e-821e-4ede-a3ee-dc2be63b737b

History

Data availability:

Eliminating Recursion in the μ-Calculus

Read this book at

Related collections

ScienceOpen Research

Most cited references 14

Results on the propositional μ-calculus

Languages, Automata, and Logic

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 3,431

Cited by 6