Skip to content
<title>Channels - A Theory of Hanoi Omega-Automata and Games :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
A Theory of Hanoi Omega-Automata and Games
Search for more channels:
Similar Items: A Theory of Hanoi Omega-Automata and Games
Channel Options
View Record
Explore related channels
Quick Look
Decomposition of Automata recognizing Ideals
Quick Look
Hyper-Minimization for Deterministic Register Automata
Quick Look
Learning Tree Automata with Term Rewriting
Quick Look
Entropy of pebble automata and space complexity
Quick Look
On the Simulation Cost of Quantum Finite Automata
Quick Look
SMT-Based Active Learning of Weighted Automata
Quick Look
Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
Quick Look
Measure Many Quantum Finite Automata on Infinite Words
Quick Look
A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
Quick Look
The speed of convergence in greedy Galois games
Quick Look
Infinite-state Games with Energy Objectives Beyond Counters
Quick Look
Brik's sequence: a strange recursion
Quick Look
A Factorization Theorem for Forest Algebras
Quick Look
Temporal Causal Models as a Model of Computation
Quick Look
Automatic constraint satisfaction problem
Quick Look
On Languages Describing Large Graph Classes
Quick Look
Forbidden-Context & Ordered Grammar Systems
Quick Look
Visualising CTL Witnesses and Counterexamples -- Extended Version
Quick Look
Active Inference of Extended Finite State Machine Models with Registers and Guards
Quick Look
Promoting Simple Agents: Ensemble Methods for Event-Log Prediction
Quick Look
Visibly Pushdown Languages in Groups
Quick Look
An algebraic characterisation of Eve-positional languages
Quick Look
Benchmarking Testing in Automated Theorem Proving
Quick Look
SemML 2.0: Synthesizing Controllers for LTL
Load more items
View Record
Prev
Explore related channels
Next
