A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata

DOI10.1016/0020-0190(93)90069-LzbMath0925.68274MaRDI QIDQ685507

I. A. Draghicescu, Edmund M. Clarke, Robert Kurshan

Publication date: 25 February 1999

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (5)

An improved algorithm for the evaluation of fixpoint expressions ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ Automated repair for timed systems ⋮ Symbolic model checking: \(10^{20}\) states and beyond ⋮ A theory of timed automata

Cites Work

• Unnamed Item
• Automata on infinite objects and their applications to logic and programming
• A linear algorithm to solve fixed-point equations on transition systems
• Complementing deterministic Büchi automata in polynomial time
• The complexity of verification
• Temporal logic can be more expressive
• Propositional dynamic logic of looping and converse is elementarily decidable
• The complexity of propositional linear temporal logics
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata