The following pages link to Alexander Okhotin (Q248926):
Displaying 31 items.
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem (Q5458520) (← links)
- Developments in Language Theory (Q5473686) (← links)
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS (Q5483377) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492902) (← links)
- HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (Q5495419) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES (Q5696956) (← links)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378) (← links)
- Machines, Computations, and Universality (Q5710888) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- (Q5747087) (← links)
- Further closure properties of input-driven pushdown automata (Q5896094) (← links)
- Formal languages over GF(2) (Q5915666) (← links)
- Formal languages over GF(2) (Q5918612) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- Least and greatest solutions of equations over sets of integers (Q5964016) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- On the transformation of LL\((k)\)-linear to LL(1)-linear grammars (Q6038708) (← links)
- Non-closure under complementation for unambiguous linear grammars (Q6040667) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
- Rational index of languages defined by grammars with bounded dimension of parse trees (Q6580079) (← links)
- Parallel enumeration of parse trees (Q6647701) (← links)
- Probabilistic input-driven pushdown automata (Q6647716) (← links)
- Decision problems for reversible and permutation automata (Q6666806) (← links)
- Conjunctive categorial grammars and Lambek grammars with additives (Q6730177) (← links)
