Viliam Geffert

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 19

Top Topics

Finite Automata

Regular Languages

Top Venues

Publications

Viliam Geffert, Dominika Palisínová, Alexander Szabari
State complexity of binary coded regular languages. Theor. Comput. Sci. 990 (2024)
Viliam Geffert
Binary Coded Unary Regular Languages. CIAA (2023)
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
Improved complement for two-way alternating automata. Acta Informatica 59 (5) (2022)
Viliam Geffert, Dominika Palisínová, Alexander Szabari
State Complexity of Binary Coded Regular Languages. DCFS (2022)
Viliam Geffert, Zuzana Bednárová, Alexander Szabari
Input-driven pushdown automata for edit distance neighborhood. Theor. Comput. Sci. 918 (2022)
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
Complement for two-way alternating automata. Acta Informatica 58 (5) (2021)
Viliam Geffert, Alexander Okhotin
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets. DCFS (2021)
Viliam Geffert, Zuzana Bednárová
Minimal Size of Counters for (Real-Time) Multicounter Automata. Fundam. Informaticae 181 (2-3) (2021)
Viliam Geffert
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). Theory Comput. Syst. 63 (4) (2019)
Viliam Geffert, Zuzana Bednárová, Alexander Szabari
Input-Driven Pushdown Automata for Edit Distance Neighborhood. DLT (2019)
Viliam Geffert, Zuzana Bednárová
Minimal Useful Size of Counters for (Real-Time) Multicounter Automata. MCU (2018)
Viliam Geffert
Complement for Two-Way Alternating Automata. CSR (2018)
Zuzana Bednárová, Viliam Geffert
Two double-exponential gaps for automata with a limited pushdown. Inf. Comput. 253 (2017)
Viliam Geffert
Alternating space is closed under complement and other simulations for sublogarithmic space. Inf. Comput. 253 (2017)
Viliam Geffert
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). CSR (2017)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Syst. Sci. 90 (2017)
Viliam Geffert
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space. DLT (2016)
Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz
New Results on the Minimum Amount of Useful Space. Int. J. Found. Comput. Sci. 27 (2) (2016)
Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. Discret. Math. Theor. Comput. Sci. 17 (2) (2015)
Viliam Geffert, Alexander Okhotin
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. MFCS (1) (2014)
Zuzana Bednárová, Viliam Geffert
Two Double-Exponential Gaps for Automata with a Limited Pushdown. LATA (2014)
Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
Two-way automata making choices only at the endmarkers. Inf. Comput. 239 (2014)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237 (2014)
Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. Electron. Colloquium Comput. Complex. 21 (2014)
Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. DCFS (2014)
Viliam Geffert, Abuzer Yakaryilmaz
Classical automata on promise problems. CoRR (2014)
Viliam Geffert, Dana Pardubská
Unary Coded NP-Complete Languages in Aspace(log log n). Int. J. Found. Comput. Sci. 24 (7) (2013)
Viliam Geffert, Dana Pardubská
Factoring and testing primes in small space. RAIRO Theor. Informatics Appl. 47 (3) (2013)
Viliam Geffert, Alexander Okhotin
One-way simulation of two-way finite automata over small alphabets. NCMA (2013)
Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano
Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. CSR (2013)
Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS (2013)
Viliam Geffert
An alternating hierarchy for finite automata. Theor. Comput. Sci. 445 (2012)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Removing Nondeterminism in Constant Height Pushdown Automata. DCFS (2012)
Viliam Geffert, Dana Pardubská
Unary Coded NP-Complete Languages in ASPACE (log log n). Developments in Language Theory (2012)
Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
Two-Way Automata Making Choices Only at the Endmarkers. LATA (2012)
Viliam Geffert, Giovanni Pighizzini
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. Algorithmica 63 (3) (2012)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
The size-cost of Boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. 449 (2012)
Viliam Geffert
An Alternating Hierarchy for Finite Automata. NCMA (2011)
Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
Two-Way Automata Making Choices Only at the Endmarkers CoRR (2011)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS (2011)
Viliam Geffert, Jozef Gajdos
In-Place Sorting. SOFSEM (2011)
Viliam Geffert, Giovanni Pighizzini
Two-way unary automata versus logarithmic space. Inf. Comput. 209 (7) (2011)
Viliam Geffert, Jozef Gajdos
Multiway in-place merging. Theor. Comput. Sci. 411 (16-18) (2010)
Viliam Geffert, Giovanni Pighizzini
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. LATIN (2010)
Viliam Geffert, Lubomíra Istonová
Translation from classical two-way automata to pebble two-way automata. RAIRO Theor. Informatics Appl. 44 (4) (2010)
Viliam Geffert, Giovanni Pighizzini
Two-Way Unary Automata versus Logarithmic Space. Developments in Language Theory (2010)
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208 (4) (2010)
Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti
One Pebble Versus epsilon * log n Bits. Fundam. Informaticae 104 (1-2) (2010)
Viliam Geffert, Dana Pardubská
Factoring and Testing Primes in Small Space. SOFSEM (2009)
Viliam Geffert, Lubomíra Istonová
Translation from Classical Two-Way Automata to Pebble Two-Way Automata DCFS (2009)
Andrew Badr, Viliam Geffert, Ian Shipman
Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Informatics Appl. 43 (1) (2009)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
One Pebble Versus log(n) Bits. NCMA (2009)
Viliam Geffert, Jozef Gajdos
Multiway In-Place Merging. FCT (2009)
Viliam Geffert, Giovanni Pighizzini
Preface. Int. J. Found. Comput. Sci. 19 (4) (2008)
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
More Concise Representation of Regular Languages by Automata and Regular Expressions. Developments in Language Theory (2008)
Viliam Geffert, Jozef Gajdos
Multiway blockwise in-place merging. ITAT (2008)
Viliam Geffert, Andrew Badr, Ian Shipman
Hyper-Minimizing Minimized Deterministic Automata. AFL (2008)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing two-way finite automata. Inf. Comput. 205 (8) (2007)
Viliam Geffert
Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205 (11) (2007)
Viliam Geffert
State Hierarchy for One-Way Finite Automata. J. Autom. Lang. Comb. 12 (1-2) (2007)
Ján Kollár, Viliam Geffert
Linear-Time In-Place Selection with epsilon.n Element Moves. Comput. Artif. Intell. 25 (4) (2006)
Viliam Geffert
Magic Numbers in the State Hierarchy of Finite Automata. MFCS (2006)
Viliam Geffert, Lubomíra Istonová
Conversion of regular expressions into realtime automata. RAIRO Theor. Informatics Appl. 40 (4) (2006)
Viliam Geffert
(Non)determinism and the Size of One-Way Finite Automata. DCFS (2005)
Gianni Franceschini, Viliam Geffert
) moves. J. ACM 52 (4) (2005)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing Two-Way Finite Automata. Developments in Language Theory (2005)
Viliam Geffert
Space hierarchy theorem revised. Theor. Comput. Sci. 295 (2003)
Viliam Geffert
Translation of binary regular expressions into nondeterministic ε-free automata with transitions. J. Comput. Syst. Sci. 66 (3) (2003)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295 (2003)
Gianni Franceschini, Viliam Geffert
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves CoRR (2003)
Gianni Franceschini, Viliam Geffert
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. FOCS (2003)
Viliam Geffert, Norbert Popély
Refinement of the Alternating Space Hierarchy. Comput. Artif. Intell. 21 (6) (2002)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. MFCS (2001)
Viliam Geffert
Space Hierarchy Theorem Revised. MFCS (2001)
Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
Asymptotically efficient in-place merging. Theor. Comput. Sci. 237 (1-2) (2000)
Viliam Geffert
A variant of inductive counting. Theor. Comput. Sci. 237 (1-2) (2000)
Viliam Geffert, Norbert Popély
-alternating machines. RAIRO Theor. Informatics Appl. 34 (5) (2000)
Viliam Geffert
Bridging Across the log(n) Space Frontier. Inf. Comput. 142 (2) (1998)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Sublogarithmic Bounds on Space and Reversals. SIAM J. Comput. 28 (1) (1998)
Viliam Geffert
A Communication Hierarchy of Parallel Computations. Theor. Comput. Sci. 198 (1-2) (1998)
Viliam Geffert
Bridging Across the log(n) Space Frontier. MFCS (1995)
Viliam Geffert
A Hierarchy That Does Not Collapse: Alternations in Low Level Space. RAIRO Theor. Informatics Appl. 28 (5) (1994)
Viliam Geffert
-Space is not Closed under Complement and Other Separation Results. RAIRO Theor. Informatics Appl. 27 (4) (1993)
Viliam Geffert
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space. SIAM J. Comput. 22 (1) (1993)
Viliam Geffert
A Speed-Up Theorem Without Tape Compression. Theor. Comput. Sci. 118 (1) (1993)
Helmut Alt, Viliam Geffert, Kurt Mehlhorn
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42 (1) (1992)
Viliam Geffert
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. SIAM J. Comput. 20 (3) (1991)
Viliam Geffert
Normal forms for phrase-structure grammars. RAIRO Theor. Informatics Appl. 25 (1991)
Viliam Geffert
How to Generate Languages Using Only Two Pairs of Parentheses. J. Inf. Process. Cybern. 27 (5/6) (1991)
Viliam Geffert
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. ICALP (1990)
Viliam Geffert
Speed-Up Theorem Without Tape Compression. MFCS (1990)
Viliam Geffert
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient. Theor. Comput. Sci. 62 (3) (1988)
Viliam Geffert
Context-Free-Like Forms for the Phrase-Structure Grammars. MFCS (1988)
Viliam Geffert
Grammars with Context Dependency Restricted to Synchronization. MFCS (1986)