BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Hungary
1 × Italy
1 × Japan
1 × Taiwan
2 × Spain
Collaborated with:
G.Pighizzini D.Pardubská C.Mereghetti Z.Bednárová B.Guillon A.Badr I.Shipman B.Palano
Talks about:
automata (6) two (4) log (4) languag (3) unari (3) space (3) way (3) regular (2) complet (2) minim (2)

Person: Viliam Geffert

DBLP DBLP: Geffert:Viliam

Contributed to:

LATA 20142014
DLT 20122012
DLT 20122013
LATA 20122012
DLT 20102010
AFL 20082008
DLT 20082008
DLT 20052005
ICALP 19901990

Wrote 9 papers:

LATA-2014-BednarovaG #automaton
Two Double-Exponential Gaps for Automata with a Limited Pushdown (ZB, VG), pp. 113–125.
DLT-2012-GeffertP
Unary Coded NP-Complete Languages in ASPACE (log log n) (VG, DP), pp. 166–177.
DLT-J-2012-GeffertP13
Unary Coded NP-Complete Languages in Aspace(log log n) (VG, DP), p. 1167–?.
LATA-2012-GeffertGP #automaton
Two-Way Automata Making Choices Only at the Endmarkers (VG, BG, GP), pp. 264–276.
DLT-2010-GeffertP #automaton
Two-Way Unary Automata versus Logarithmic Space (VG, GP), pp. 197–208.
AFL-2008-GeffertBS #automaton
Hyper-Minimizing Minimized Deterministic Automata (VG, AB, IS), pp. 9–30.
DLT-2008-GeffertMP #automaton #regular expression #representation
More Concise Representation of Regular Languages by Automata and Regular Expressions (VG, CM, BP), pp. 359–370.
DLT-2005-GeffertMP #automaton #finite
Complementing Two-Way Finite Automata (VG, CM, GP), pp. 260–271.
ICALP-1990-Geffert #nondeterminism
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility (VG), pp. 111–124.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.