Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik 7, RWTH Aachen, Germany
Add to Reading List
Document Date: 2012-05-29 11:02:30
Open Document
File Size: 283,58 KB
Share Result on Facebook
City
Addison-Wesley /
/
IndustryTerm
graph algorithms /
/
Person
Dimitri Isaaka /
/
ProvinceOrState
New York /
A /
/
Technology
graph algorithms /
following algorithm /
XML /
Computer Algorithms /
/
SocialTag
Ω-automaton
Deterministic finite automaton
Tree automaton
Nondeterministic finite automaton
Omega language
Sequence
Muller automaton
Büchi automaton
Automata theory
Theoretical computer science
Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik 7, RWTH Aachen, Germany