Systolic tree \(\omega\)-languages: The operational and the logical view

DOI10.1016/S0304-3975(97)00257-0zbMath0952.68081MaRDI QIDQ1575949

Angelo Monti, Adriano Peron

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

SIS\(\omega\)-languagessystolic tree automataBüchi \(\omega\)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Choice functions and well-orderings over the infinite binary tree ⋮ Definability and decidability of binary predicates for time granularity ⋮ On the relationships between theories of time granularity and the monadic second-order theory of one successor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completeness results concerning systolic tree automata and E0L languages
• Synthesis, structure and power of systolic computations
• The complementation problem for Büchi automata with applications to temporal logic
• Modalities for model checking: Branching time logic strikes back
• Systolic tree ω-languages
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor

This page was built for publication: Systolic tree \(\omega\)-languages: The operational and the logical view