Travelled to:1 × Australia
1 × Czech Republic
1 × Finland
1 × Greece
1 × New Zealand
1 × Portugal
1 × Russia
1 × South Africa
1 × Sweden
1 × The Netherlands
1 × United Kingdom
2 × Italy
2 × Taiwan
2 × USA
3 × France
3 × Germany
3 × Japan
3 × Spain
4 × Canada
4 × Hungary
Collaborated with:M.Holzer A.Malcher H.Bordihn M.Wendlandt F.Otto T.Buchholz S.Jakobi H.Messerschmidt A.Klein J.Reimann J.Richstein C.Mereghetti B.Palano K.Meckel U.Leiter L.Werlein D.Wotschke S.Beier E.Formenti J.Provillard S.Bensch
Talks about:automata (40) finit (20) languag (14) complex (12) pushdown (11) communic (8) input (8) descript (7) nondeterminist (6) determinist (6)
Person: Martin Kutrib
DBLP: Kutrib:Martin
Facilitated 1 volumes:
EdContributed to:
2015
2015
20142014
2014201320152013201420122013201220112011201120102010201120102009200920082010200820092008200820072007200720062007200620052004200520042003
2003200220022001
20001999199719952017Wrote 55 papers:
- CIAA-2015-KutribW #capacity
- Expressive Capacity of Concatenation Freeness (MK, MW), pp. 199–210.
- DLT-2015-HolzerJK #automaton #finite
- Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.
- AFL-2014-BordihnKM #automaton #communication #finite #parallel
- Measuring Communication in Parallel Communicating Finite Automata (HB, MK, AM), pp. 124–138.
- DLT-2014-KutribM #automaton #communication
- Measuring Communication in Automata Systems — (MK, AM), pp. 260–274.
- DLT-2014-KutribMW #automaton #set
- Deterministic Set Automata (MK, AM, MW), pp. 303–314.
- LATA-2014-FormentiHKP #complexity
- ω-rational Languages: High Complexity Classes vs. Borel Hierarchy (EF, MH, MK, JP), pp. 372–383.
- CIAA-2013-KutribMMPW #automaton #decidability #finite #queue
- Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.
- CIAA-J-2013-KutribMMPW15 #automaton #decidability #finite #queue
- Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.
- DLT-2013-KutribMW #automaton #finite #multi
- One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
- DLT-J-2013-KutribMW14a #automaton #finite #multi
- Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.
- CIAA-2012-KutribO #automaton #complexity #on the
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.
- CIAA-J-2012-KutribO13 #automaton #complexity #on the
- On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
- DLT-2012-KutribMW #automaton #finite #multi
- States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.
- 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-HolzerKL
- Nodes Connected by Path Languages (MH, MK, UL), pp. 276–287.
- CIAA-2010-KutribM
- Two-Party Watson-Crick Computations (MK, AM), pp. 191–200.
- DLT-2010-BordihnKM #automaton #communication #finite #parallel
- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 88–99.
- DLT-2010-HolzerK #complexity
- The Complexity of Regular(-Like) Expressions (MH, MK), pp. 16–30.
- DLT-J-2010-BordihnKM11 #automaton #communication #finite #parallel
- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 1577–1592.
- DLT-J-2010-HolzerK11 #complexity
- The Complexity of Regular(-like) Expressions (MH, MK), pp. 1533–1548.
- LATA-2010-KutribM #automaton
- Reversible Pushdown Automata (MK, AM), pp. 368–379.
- CIAA-2009-KutribM #automaton #communication
- Cellular Automata with Sparse Communication (MK, AM), pp. 34–43.
- 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.
- AFL-2008-KutribMO #automaton #on the
- On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.
- AFL-J-2008-KutribMO10 #automaton #on the
- On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.
- 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-BordihnKM #automaton #capacity #communication #finite #on the #parallel
- On the Computational Capacity of Parallel Communicating Finite Automata (HB, MK, AM), pp. 146–157.
- LATA-2008-BenschBHK #automaton #finite
- Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.
- CIAA-2007-KutribMW #automaton #nondeterminism
- Regulated Nondeterminism in Pushdown Automata (MK, AM, LW), pp. 85–96.
- DLT-2007-BordihnHK #automaton #finite
- Hairpin Finite Automata (HB, MH, MK), pp. 108–119.
- LATA-2007-KutribM #automaton #performance #recognition #using
- Fast Reversible Language Recognition Using Cellular Automata (MK, AM), pp. 331–342.
- LATA-2007-KutribR #automaton #regular expression
- Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.
- 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-KutribM #automaton #nondeterminism
- Context-Dependent Nondeterminism for Pushdown Automata (MK, AM), pp. 133–144.
- DLT-2005-BordihnHK #automaton #finite
- Revolving-Input Finite Automata (HB, MH, MK), pp. 168–179.
- 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-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-2004-KutribMW #context-free grammar #linear
- The Boolean Closure of Linear Context-Free Languages (MK, AM, DW), pp. 284–295.
- 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.
- CIAA-2001-HolzerK #encoding #image #order #using
- Improving Raster Image Run-Length Encoding Using Data Order (MH, MK), pp. 161–176.
- WLC-2000-BuchholzKK #array #communication #nondeterminism
- Iterative Arrays With Limited Nondeterministic Communication Cell (TB, AK, MK), pp. 73–87.
- DLT-1999-BuchholzKK #automaton #on the
- On tally languages and generalized interacting automata (TB, AK, MK), pp. 316–325.
- DLT-1997-BuchholzK #bound #on the #power of
- On the power of one-way bounded cellular time computers (TB, MK), pp. 365–375.
- DLT-1995-KutribR #automaton #realtime
- Real-Time One-Way Pushdown Cellular Automata Languages (MK, JR), pp. 420–429.
- 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.