Efficient inclusion testing for simple classes of unambiguous -automata
From MaRDI portal
Publication:436610
DOI10.1016/J.IPL.2012.04.010zbMATH Open1243.68201OpenAlexW1969561112MaRDI QIDQ436610FDOQ436610
Christof Löding, Dimitri Isaak
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.010
Recommendations
Cites Work
- Deciding Equivalence of Finite Tree Automata
- On the minimization of XML schemas and tree automata for unranked trees
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unambiguous Büchi automata.
- Rational \(\omega\)-languages are non-ambiguous
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
Cited In (7)
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- Testing language containment for \(\omega\)-automata using BDDs
- Markov chains and unambiguous automata
- Process-centric views of data-driven business artifacts
- Short Witnesses and Accepting Lassos in ω-Automata
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
This page was built for publication: Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436610)
