Efficient inclusion testing for simple classes of unambiguous ω-automata

Authors:
Dimitri Isaak;Christof LöDing
Affiliations:
Informatik 7, RWTH Aachen, Germany;Informatik 7, RWTH Aachen, Germany
Venue:
Information Processing Letters
Year:
2012

Citing 6
Cited 0

Deciding equivalence of finite tree automata

SIAM Journal on Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Unambiguous Büchi automata

Theoretical Computer Science - Latin American theoretical informatics
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Complementation, Disambiguation, and Determinization of Büchi Automata Unified

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Equivalence and inclusion problem for strongly unambiguous büchi automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that language inclusion for languages of infinite words defined by nondeterministic automata can be tested in polynomial time if the automata are unambiguous and have simple acceptance conditions, namely safety or reachability conditions. An automaton with safety condition accepts an infinite word if there is a run that never visits a forbidden state, and an automaton with reachability condition accepts an infinite word if there is a run that visits an accepting state at least once.