Backward Deterministic Büchi Automata on Infinite Words

DOI10.4230/LIPICS.FSTTCS.2017.6MaRDI QIDQ5136295zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3990873 (Why is no real title available?)
• scientific article; zbMATH DE number 1304310 (Why is no real title available?)
• scientific article; zbMATH DE number 1512707 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A remark on finite transducers
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decision problems forω-automata
• Effective characterizations of simple fragments of temporal logic using Carton-Michel automata
• On finite monoids having only trivial subgroups
• Past, present, and infinite future
• Reasoning about infinite computations
• Right-sequential functions on infinite words
• Testing and generating infinite sequences by a finite automaton
• Unambiguous Büchi automata.

Cited in

(1)

• On the translation of automata to linear temporal logic

This page was built for publication: Backward Deterministic Büchi Automata on Infinite Words

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