Follow
Viliam Geffert
Viliam Geffert
Unknown affiliation
Verified email at upjs.sk
Title
Cited by
Cited by
Year
Normal forms for phrase-structure grammars
V Geffert
RAIRO-Theoretical Informatics and Applications 25 (5), 473-496, 1991
1061991
Converting two-way nondeterministic unary automata into simpler automata
V Geffert, C Mereghetti, G Pighizzini
Theoretical Computer Science 295 (1-3), 189-203, 2003
812003
Asymptotically efficient in-place merging
V Geffert, J Katajainen, T Pasanen
Theoretical Computer Science 237 (1-2), 159-181, 2000
732000
Complementing two-way finite automata
V Geffert, C Mereghetti, G Pighizzini
Information and Computation 205 (8), 1173-1187, 2007
682007
Nondeterministic computations in sublogarithmic space and space constructibility
V Geffert
SIAM Journal on Computing 20 (3), 484-498, 1991
611991
Context-free-like forms for the phrase-structure grammars
V Geffert
International Symposium on Mathematical Foundations of Computer Science, 309-317, 1988
601988
An In-Place Sorting with O (n log n) Comparisons and O (n) Moves
G Franceschini, V Geffert
Journal of the ACM (JACM) 52 (4), 515-537, 2005
532005
Magic numbers in the state hierarchy of finite automata
V Geffert
Information and Computation 205 (11), 1652-1670, 2007
522007
Hyper-minimizing minimized deterministic finite state automata
A Badr, V Geffert, I Shipman
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2009
432009
More concise representation of regular languages by automata and regular expressions
V Geffert, C Mereghetti, B Palano
Information and computation 208 (4), 385-394, 2010
412010
Tally versions of the Savitch and Immerman–Szelepcsényi theorems for sublogarithmic space
V Geffert
SIAM Journal on Computing 22 (1), 102-113, 1993
361993
A hierarchy that does not collapse: alternations in low level space
V Geffert
RAIRO-Theoretical Informatics and Applications 28 (5), 465-512, 1994
321994
An alternating hierarchy for finite automata
V Geffert
Theoretical Computer Science 445, 1-24, 2012
272012
Two-way unary automata versus logarithmic space
V Geffert, G Pighizzini
Information and Computation 209 (7), 1016-1025, 2011
242011
The size-cost of Boolean operations on constant height deterministic pushdown automata
Z Bednárová, V Geffert, C Mereghetti, B Palano
Theoretical Computer Science 449, 23-36, 2012
232012
A lower bound for the nondeterministic space complexity of context-free recognition
H Alt, V Geffert, K Mehlhorn
Information Processing Letters 42 (1), 25-27, 1992
231992
Translation of binary regular expressions into nondeterministic ε-free automata with O (nlogn) transitions
V Geffert
Journal of Computer and System Sciences 66 (3), 451-472, 2003
212003
Transforming two-way alternating finite automata to one-way nondeterministic automata
V Geffert, A Okhotin
International Symposium on Mathematical Foundations of Computer Science, 291-302, 2014
202014
Space hierarchy theorem revised
V Geffert
Theoretical computer science 295 (1-3), 171-187, 2003
202003
How to generate languages using only two pairs of parentheses
V Geffert
Elektronische Informationsverarbeitung und Kybernetik 27 (5/6), 303-315, 1991
191991
The system can't perform the operation now. Try again later.
Articles 1–20