The following pages link to Viliam Geffert (Q442278):
Displayed 50 items.
- An alternating hierarchy for finite automata (Q442279) (← links)
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- A speed-up theorem without tape compression (Q688718) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Multiway in-place merging (Q964398) (← links)
- A representation of recursively enumerable languages by two homomorphisms and a quotient (Q1115633) (← links)
- A communication hierarchy of parallel computations (Q1129258) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
- (Q1566716) (redirect page) (← links)
- A variant of inductive counting (Q1566745) (← links)
- Minimal useful size of counters for (real-time) multicounter automata (Q1647318) (← links)
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
- State complexity of binary coded regular languages (Q2112182) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Improved complement for two-way alternating automata (Q2675811) (← links)
- A Space Lower Bound for Acceptance by One-Way Π<sub>2</sub>-Alternating Machines (Q2720409) (← links)
- New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- A Direct Construction of Finite State Automata for Pushdown Store Languages (Q2843087) (← links)
- Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata (Q2922024) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- One Pebble Versus ϵ · log n Bits (Q3000290) (← links)
- In-Place Sorting (Q3075523) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- Unary Coded NP-Complete Languages in ASPACE (log log n) (Q3167493) (← links)
- Removing Nondeterminism in Constant Height Pushdown Automata (Q3167573) (← links)
- Multiway In-Place Merging (Q3183603) (← links)
- (Q3359748) (← links)
- Conversion of regular expressions into realtime automata (Q3423141) (← links)
- (Q3435060) (← links)
- (Q3455037) (← links)
- (Q3517099) (← links)
- More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
- An in-place sorting with <i>O</i> ( <i>n</i> log <i>n</i> ) comparisons and <i>O</i> ( <i>n</i> ) moves (Q3546298) (← links)
- Hyper-minimizing minimized deterministic finite state automata (Q3549289) (← links)
- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata (Q3557021) (← links)
- Bridging across the log(n) space frontier (Q3568999) (← links)
- Two-Way Unary Automata versus Logarithmic Space (Q3584893) (← links)