Tightening the Exchange Rates Between Automata

DOI10.1007/978-3-540-74915-8_5zbMATH Open1179.68072OpenAlexW1599755483MaRDI QIDQ3608401FDOQ3608401

Authors: Orna Kupferman 

Publication date: 5 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_5

Recommendations

• scientific article; zbMATH DE number 5872401
• Automata theory and model checking
• Finite-state automata on infinite inputs
• The automata-theoretic approach to verification of reactive systems
• Automata over infinite alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (1)

• The quest for a tight translation of Büchi to co-Büchi automata

This page was built for publication: Tightening the Exchange Rates Between Automata

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