An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Decidability of Monadic Theories
Proceedings of the Mathematical Foundations of Computer Science 1984
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Decidable Theories of Cayley-Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Automata logics, and infinite games
On the structure of graphs in the Caucal hierarchy
Theoretical Computer Science
Model Transformations in Decidability Proofs for Monadic Theories
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Formal Methods in System Design
An automata-theoretic approach to infinite-state systems
Time for verification
Frame definability for classes of trees in the µ-calculus
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Characterizing EF over infinite trees and modal logic on transitive graphs
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular sets over extended tree structures
Theoretical Computer Science
Church synthesis problem with parameters
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 5.23 |
An operation M* which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such tree-like structures is defined. It is shown that automata of this kind characterise expressive power of monadic second-order logic (MSOL) over tree-like structures. Using this characterisation it is proved that MSOL theory of a tree-like structure is effectively reducible to that of the original structure. As another application of the characterisation it is shown that MSOL on trees of arbitrary degree is equivalent to first-order logic extended with unary least fixpoint operator.