The monadic theory of finite representations of infinite words

DOI10.1016/J.IPL.2007.02.014zbMath1184.68313OpenAlexW4365810643WikidataQ58215632 ScholiaQ58215632MaRDI QIDQ2379951

David Janin, Anuj Dawar

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.014

zbMATH Keywords

specification languageslogicdescriptive complexityautomata on infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal characterisation theorems over special classes of frames
• Modal logic over finite structures
• Reachability is harder for directed than for undirected finite graphs
• Incremental model checking for decomposable structures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic

This page was built for publication: The monadic theory of finite representations of infinite words