Backward Deterministic Büchi Automata on Infinite Words
From MaRDI portal
Publication:5136295
DOI10.4230/LIPICS.FSTTCS.2017.6zbMATH Open1491.68103OpenAlexW2788636948MaRDI QIDQ5136295FDOQ5136295
Authors: Thomas Wilke
Publication date: 25 November 2020
Full work available at URL: http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2017.html#Wilke17
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)
Cites Work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Reasoning about infinite computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing and generating infinite sequences by a finite automaton
- Decision problems forω-automata
- Unambiguous Büchi automata.
- Title not available (Why is that?)
- Past, present, and infinite future
- Title not available (Why is that?)
- Effective characterizations of simple fragments of temporal logic using Carton-Michel automata
- A remark on finite transducers
- Right-sequential functions on infinite words
Cited In (1)
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)