Travelled to:1 × Canada
1 × Italy
1 × Russia
1 × Sweden
1 × Taiwan
1 × United Kingdom
2 × Hungary
Collaborated with:M.Holzer M.Kutrib H.Gruber I.McQuillan
Talks about:minim (6) automata (4) equival (4) more (3) determinist (2) biautomata (2) languag (2) beyond (2) almost (2) finit (2)
Person: Sebastian Jakobi
DBLP: Jakobi:Sebastian
Contributed to:
2015
2015
2014201420132012201320112011Wrote 10 papers:
- CIAA-2015-GruberHJ #automaton #finite #nondeterminism
- More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.
- DLT-2015-HolzerJK #automaton #finite
- Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.
- AFL-2014-HolzerJ #automaton #product line #regular expression
- More Structural Characterizations of Some Subregular Language Families by Biautomata (MH, SJ), pp. 271–285.
- DLT-2014-HolzerJ #automaton
- Minimal and Hyper-Minimal Biautomata — (MH, SJ), pp. 291–302.
- CIAA-2013-HolzerJ #algorithm #robust
- Brzozowski’s Minimization Algorithm — More Robust than Expected — (MH, SJ), pp. 181–192.
- DLT-2012-HolzerJ #automaton #equivalence #fault
- From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (MH, SJ), pp. 190–201.
- DLT-2012-HolzerJM #context-free grammar
- Generalized Derivations with Synchronized Context-Free Grammars (MH, SJ, IM), pp. 109–120.
- DLT-J-2012-HolzerJ13 #automaton #equivalence #fault
- From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.
- AFL-2011-HolzerJK
- The Chop of Languages (MH, SJ, MK), pp. 197–210.
- DLT-2011-HolzerJ #complexity
- Chop Operations and Expressions: Descriptional Complexity Considerations (MH, SJ), pp. 264–275.