Travelled to:1 × Australia
1 × Austria
1 × Greece
1 × Iceland
1 × New Zealand
1 × Russia
1 × South Africa
1 × Sweden
1 × The Netherlands
1 × United Kingdom
2 × Finland
2 × France
2 × Italy
2 × Japan
2 × Taiwan
2 × USA
3 × Canada
3 × Germany
3 × Hungary
3 × Spain
Collaborated with:M.Kutrib H.Gruber S.Jakobi H.Bordihn B.König ∅ H.Fernau R.Freund A.Maletti J.Dassow I.McQuillan K.Meckel U.Leiter M.Tautschnig S.Beier E.Formenti J.Provillard S.Bensch A.Kiehn M.H.t.Beek E.Csuhaj-Varjú G.Vaszil M.Beaudry G.Niemann F.Otto C.Damm K.Lange P.Rossmanith A.Malcher M.Wendlandt
Talks about:automata (26) finit (21) complex (17) languag (16) determinist (9) minim (9) nondeterminist (8) express (8) oper (8) descript (7)
Person: Markus Holzer
DBLP: Holzer:Markus
Facilitated 1 volumes:
EdContributed to:
2015
2015
20142014
201420132012201320112011201120102011200920092009200820092008
20082008200720072006200720062005200420052004200520032003200220022001200119991997199519932017Wrote 57 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-FernauFH #distributed #finite #hybrid
- Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes (HF, RF, MH), pp. 246–260.
- 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.
- 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.
- LATA-2014-FormentiHKP #complexity
- ω-rational Languages: High Complexity Classes vs. Borel Hierarchy (EF, MH, MK, JP), pp. 372–383.
- 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.
- CIAA-2011-HolzerK #automaton #finite
- Gaining Power by Input Operations: Finite Automata and Beyond (MH, MK), pp. 16–29.
- CIAA-2011-HolzerKM #complexity #nondeterminism
- Nondeterministic State Complexity of Star-Free Languages (MH, MK, KM), pp. 178–189.
- DLT-2011-HolzerJ #complexity
- Chop Operations and Expressions: Descriptional Complexity Considerations (MH, SJ), pp. 264–275.
- DLT-2011-HolzerKL
- Nodes Connected by Path Languages (MH, MK, UL), pp. 276–287.
- DLT-2010-HolzerK #complexity
- The Complexity of Regular(-Like) Expressions (MH, MK), pp. 16–30.
- DLT-J-2010-HolzerK11 #complexity
- The Complexity of Regular(-like) Expressions (MH, MK), pp. 1533–1548.
- CIAA-2009-GruberHT #automaton #empirical #finite #regular expression
- Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.
- CIAA-2009-HolzerM #algorithm #automaton
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
- DLT-2009-GruberH #bound #complexity #regular expression
- Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.
- LATA-2009-BordihnHK #problem #subclass
- Undecidability of Operation Problems for T0L Languages and Subclasses (HB, MH, MK), pp. 236–246.
- LATA-2009-HolzerK #automaton #complexity #finite
- Descriptional and Computational Complexity of Finite Automata (MH, MK), pp. 23–42.
- CIAA-2008-HolzerK #complexity #finite #nondeterminism
- Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 1–16.
- CIAA-J-2008-HolzerK09 #automaton #complexity #finite #nondeterminism
- Nondeterministic Finite Automata — Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 563–580.
- DLT-2008-GruberH #automaton #finite #regular expression
- Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
- ICALP-B-2008-GruberH #automaton #finite #regular expression
- Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.
- LATA-2008-BenschBHK #automaton #finite
- Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.
- LATA-2008-BordihnH #distributed #random
- Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems (HB, MH), pp. 125–136.
- DLT-2007-BordihnHK #automaton #finite
- Hairpin Finite Automata (HB, MH, MK), pp. 108–119.
- 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.
- CIAA-2006-BordihnHK #automaton #finite #hybrid
- Hybrid Extended Finite Automata (HB, MH, MK), pp. 34–45.
- CIAA-J-2006-BordihnHK07 #automaton #finite #hybrid
- Hybrid Extended Finite Automata (HB, MH, MK), pp. 745–760.
- DLT-2006-GruberH #bound #complexity #nondeterminism
- Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.
- DLT-2005-BordihnHK #automaton #finite
- Revolving-Input Finite Automata (HB, MH, MK), pp. 168–179.
- DLT-2005-GruberHKK #automaton #on the
- On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.
- CIAA-2004-BordihnHK #context-free grammar #linear #problem
- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.
- CIAA-J-2004-BordihnHK05 #context-free grammar #problem #subclass
- Unsolvability levels of operation problems for subclasses of context-free languages (HB, MH, MK), pp. 423–440.
- DLT-2004-BeekCHV #on the
- On Competence in CD Grammar Systems (MHtB, ECV, MH, GV), pp. 76–88.
- DLT-2004-BordihnHK #automaton #geometry
- Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages (HB, MH, MK), pp. 102–113.
- DLT-J-2004-DassowH05 #problem #product line
- Language families defined by a ciliate bio-operation: hierarchies and decision problems (JD, MH), pp. 645–662.
- DLT-2003-HolzerK #automaton #finite #monad #on the
- On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.
- DLT-2003-HolzerK03a #automaton #nondeterminism
- Flip-Pushdown Automata: Nondeterminism Is Better than Determinism (MH, MK), pp. 361–372.
- ICALP-2003-HolzerK #automaton
- Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k (MH, MK), pp. 490–501.
- CIAA-2002-HolzerK #automaton #complexity #finite #nondeterminism
- State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.
- DLT-2002-HolzerK #complexity #nondeterminism
- Unary Language Operations and Their Nondeterministic State Complexity (MH, MK), pp. 162–172.
- DLT-2002-HolzerK02a #automaton #finite #monad #on the
- On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.
- CIAA-2001-HolzerK #encoding #image #order #using
- Improving Raster Image Run-Length Encoding Using Data Order (MH, MK), pp. 161–176.
- DLT-2001-BeaudryHNO #on the #product line
- On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy (MB, MH, GN, FO), pp. 340–348.
- DLT-1999-BordihnH #component #distributed
- Cooperating distributed grammar systems with non-terminating components (HB, MH), pp. 305–315.
- DLT-1999-Holzer #on the
- On fixed and general membership for external and internal contextual languages (MH), pp. 351–361.
- DLT-1997-FernauHF #bound #distributed
- Bounding resources in Cooperating Distributed Grammar Systems (HF, MH, RF), pp. 261–272.
- DLT-1995-Holzer #automaton #finite #on the
- On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.
- DLT-1993-DammHLR #complexity
- Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.
- AFL-2017-BeierHK #complexity #linear #on the #set
- On the Descriptional Complexity of Operations on Semilinear Sets (SB, MH, MK), pp. 41–55.
- AFL-2017-HolzerKMW #automaton
- Input-Driven Double-Head Pushdown Automata (MH, MK, AM, MW), pp. 128–142.