Amanote Research
Register
Sign In
Lower Bounds for Complementation of Omega-Automata via the Full Automata Technique
Logical Methods in Computer Science
- Germany
doi 10.2168/lmcs-4(1:5)2008
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Science
Theoretical Computer Science
Date
March 19, 2008
Authors
Qiqi Yan
Publisher
Logical Methods in Computer Science e.V.
Related search
Lower Bounds for the Length of Reset Words in Eulerian Automata
International Journal of Foundations of Computer Science
Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
GOAL for Games, Omega-Automata, and Logics
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Tighter Bounds for the Determinisation of Büchi Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
FUZZY Omega -AUTOMATA AND ITS RELATIONSHIPS
International Journal of Pure and Applied Mathematics
Mathematics
Applied Mathematics
Lower-Bound Constrained Runs in Weighted Timed Automata
Robust Analysis of Timed Automata via Channel Machines
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Impact of Alphabet Size on Pattern Complexity of Maxmin-$$\Omega$$ω Cellular Automata
Natural Computing
Computer Science Applications
An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata
Transactions of the American Mathematical Society
Mathematics
Applied Mathematics
