PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA

DOI10.1142/S0129054111009082zbMath1251.68134OpenAlexW2568259530MaRDI QIDQ3224953

Manfred Kufleitner, Alexander Lauser

Publication date: 13 March 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111009082

zbMATH Keywords

first-order logicinfinite wordstwo-way Büchi automaton

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Partially Ordered Two-Way Büchi Automata

Cites Work

• Fragments of first-order logic over infinite words
• Automates boustrophédon et mots infinis
• The complementation problem for Büchi automata with applications to temporal logic
• Classifying regular events in symbolic logic
• Polynomial closure and unambiguous product

This page was built for publication: PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA