A unified approach for showing language inclusion and equivalence between various types of -automata

DOI10.1016/0020-0190(93)90069-LMaRDI QIDQ685507zbMATH OpenFDO

Authors I. A. Draghicescu, Edmund Clarke, R. P. 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)

Cites work

• scientific article; zbMATH DE number 3993549 (Why is no real title available?)
• A linear algorithm to solve fixed-point equations on transition systems
• Automata on infinite objects and their applications to logic and programming
• Complementing deterministic Büchi automata in polynomial time
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Propositional dynamic logic of looping and converse is elementarily decidable
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• The complexity of verification

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685507)