The following pages link to Viliam Geffert (Q442278):
Displayed 32 items.
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- (Q3751035) (← links)
- (Q3798273) (← links)
- Nondeterministic Computations in Sublogarithmic Space and Space Constructibility (Q3978779) (← links)
- (Q3980380) (← links)
- Normal forms for phrase-structure grammars (Q3991298) (← links)
- Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space (Q4037687) (← links)
- (Q4038686) (← links)
- Sublogarithmic Bounds on Space and Reversals (Q4210151) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
- (Q4680180) (← links)
- (Q4785461) (← links)
- (Q4785462) (← links)
- Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height (Q4928476) (← links)
- (Q5146523) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
- Factoring and testing primes in small space (Q5397718) (← links)
- Two Double-Exponential Gaps for Automata with a Limited Pushdown (Q5404905) (← links)
- Developments in Language Theory (Q5473677) (← links)
- UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(<font>log log</font> n) (Q5495427) (← links)
- Classical Automata on Promise Problems (Q5496183) (← links)
- Magic Numbers in the State Hierarchy of Finite Automata (Q5756671) (← links)
- Asymptotically efficient in-place merging (Q5915346) (← links)
- Complement for two-way alternating automata (Q5915575) (← links)
- Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5919539) (← links)
- Input-driven pushdown automata for edit distance neighborhood (Q5919663) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5920059) (← links)
- State complexity of binary coded regular languages (Q6120344) (← links)
- Binary coded unary regular languages (Q6199860) (← links)