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 × Australia
1 × Finland
1 × Iceland
1 × Italy
1 × Japan
1 × Sweden
1 × USA
2 × Germany
2 × Hungary
Collaborated with:
M.Holzer S.Gulan J.Johannsen S.Jakobi M.Tautschnig A.Kiehn B.König
Talks about:
regular (7) express (7) automata (6) complex (6) finit (6) nondeterminist (3) bound (3) determinist (2) descript (2) languag (2)

Person: Hermann Gruber

DBLP DBLP: Gruber:Hermann

Contributed to:

CIAA 20152015
AFL 20142014
LATA 20102010
CIAA 20092009
DLT 20092009
DLT 20082008
FoSSaCS 20082008
ICALP (2) 20082008
DLT 20072007
LATA 20072007
DLT 20062006
DLT 20052005

Wrote 12 papers:

CIAA-2015-GruberHJ #automaton #finite #nondeterminism
More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.
AFL-2014-GruberH #automaton #complexity #finite #regular expression #summary
From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.
LATA-2010-GruberG #regular expression
Simplifying Regular Expressions (HG, SG), pp. 285–296.
CIAA-2009-GruberHT #automaton #empirical #finite #regular expression
Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.
DLT-2009-GruberH #bound #complexity #regular expression
Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.
DLT-2008-GruberH #automaton #finite #regular expression
Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
FoSSaCS-2008-GruberJ #bound #communication #complexity #regular expression #using
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
ICALP-B-2008-GruberH #automaton #finite #regular expression
Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.
DLT-2007-GruberH #complexity #exclamation #nondeterminism
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP (HG, MH), pp. 205–216.
LATA-2007-GruberH #automaton #complexity #finite #nondeterminism
Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.
DLT-2006-GruberH #bound #complexity #nondeterminism
Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.
DLT-2005-GruberHKK #automaton #on the
On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.
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.