Backward Deterministic Büchi Automata on Infinite Words

DOI10.4230/LIPIcs.FSTTCS.2017.6zbMath1491.68103OpenAlexW2788636948MaRDI QIDQ5136295

Thomas Wilke

Publication date: 25 November 2020

Full work available at URL: http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2017.html#Wilke17

zbMATH Keywords

determinismfinite automatatemporal logicinfinite wordsbackward automataseparated formulas

Mathematics Subject Classification ID

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

Related Items

On the translation of automata to linear temporal logic, Regular transducer expressions for regular transformations

Cites Work

• Reasoning about infinite computations
• Unambiguous Büchi automata.
• Right-Sequential Functions on Infinite Words
• Past, Present, and Infinite Future
• Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
• On finite monoids having only trivial subgroups
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• A remark on finite transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item