Skip to content
<title>Channels - Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Search for more channels:
Similar Items: Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Channel Options
View Record
Explore related channels
Quick Look
Good-for-games $omega$-Pushdown Automata
Quick Look
Weighted omega-Restricted One Counter Automata
Quick Look
A Theory of Hanoi Omega-Automata and Games
Quick Look
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Quick Look
Petri Automata
Quick Look
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
Quick Look
Timed Automata Robustness Analysis via Model Checking
Quick Look
Modal Interface Automata
Quick Look
Stochastic Timed Automata
Quick Look
Logic and Branching Automata
Quick Look
History-Register Automata
Quick Look
Inferring Symbolic Automata
Quick Look
Consistency of circuit lower bounds with bounded theories
Quick Look
Sampled Semantics of Timed Automata
Quick Look
Weak Alternating Timed Automata
Quick Look
Automata theory in nominal sets
Quick Look
Refinement and Difference for Probabilistic Automata
Quick Look
Minimisation of Multiplicity Tree Automata
Quick Look
Data optimizations for constraint automata
Quick Look
Edit Distance for Pushdown Automata
Quick Look
Pushing for weighted tree automata
Quick Look
Pumping lemmas for weighted automata
Quick Look
Determinisability of register and timed automata
Quick Look
Comparator automata in quantitative verification
Load more items
View Record
Prev
Explore related channels
Next
