Skip to content
Channels - Deterministic pushdown automata can compress some normal sequences :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Deterministic pushdown automata can compress some normal sequences
Search for more channels:
Similar Items: Deterministic pushdown automata can compress some normal sequences
Channel Options
View Record
Explore related channels
Quick Look
Edit Distance for Pushdown Automata
Quick Look
Model Checking Probabilistic Pushdown Automata
Quick Look
Good-for-games $omega$-Pushdown Automata
Quick Look
History-deterministic Timed Automata
Quick Look
Beyond Language Equivalence on Visibly Pushdown Automata
Quick Look
Model-Checking of Ordered Multi-Pushdown Automata
Quick Look
Reachability Problem for Weak Multi-Pushdown Automata
Quick Look
Minimization of visibly pushdown automata is NP-complete
Quick Look
On the Expressive Power of 2-Stack Visibly Pushdown Automata
Quick Look
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Quick Look
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
Quick Look
Computing the Width of Non-deterministic Automata
Quick Look
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
Quick Look
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Quick Look
Token Games and History-Deterministic Quantitative-Automata
Quick Look
Random Deterministic Automata With One Added Transition
Quick Look
Half-Positional Objectives Recognized by Deterministic Büchi Automata
Quick Look
Off-line test selection with test purposes for non-deterministic timed automata
Quick Look
Normalizing the Taylor expansion of non-deterministic {lambda}-terms, via parallel reduction of resource vectors
Quick Look
Reachability Analysis of Communicating Pushdown Systems
Quick Look
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
Quick Look
Polishness of some topologies related to word or tree automata
Quick Look
Hyper-Minimization for Deterministic Register Automata
Quick Look
Weighted Pushdown Systems with Indexed Weight Domains
Load more items
View Record
Prev
Explore related channels
Next