Follow
Martin Kutrib
Martin Kutrib
Unknown affiliation
Verified email at informatik.uni-giessen.de
Title
Cited by
Cited by
Year
Descriptional and computational complexity of finite automata—A survey
M Holzer, M Kutrib
Information and Computation 209 (3), 456-470, 2011
1642011
Nondeterministic descriptional complexity of regular languages
M Holzer, M Kutrib
International Journal of Foundations of Computer Science 14 (06), 1087-1102, 2003
1522003
State complexity of basic operations on nondeterministic finite automata
M Holzer, M Kutrib
International Conference on Implementation and Application of Automata, 148-157, 2002
822002
Descriptional complexity—an introductory survey
M Holzer, M Kutrib
Scientific Applications of Language Methods, 1-58, 2011
762011
Determination of finite automata accepting subregular languages
H Bordihn, M Holzer, M Kutrib
Theoretical Computer Science 410 (35), 3209-3222, 2009
652009
Complexity of multi-head finite automata: Origins and directions
M Holzer, M Kutrib, A Malcher
Theoretical Computer Science 412 (1-2), 83-96, 2011
612011
Reversible pushdown automata
M Kutrib, A Malcher
Journal of Computer and System Sciences 78 (6), 1814-1827, 2012
602012
Unary language operations and their nondeterministic state complexity
M Holzer, M Kutrib
International Conference on Developments in Language Theory, 162-172, 2002
572002
Nondeterministic finite automata—recent results on the descriptional and computational complexity
M Holzer, M Kutrib
International Journal of Foundations of Computer Science 20 (04), 563-580, 2009
562009
On time computability of functions in one-way cellular automata
T Buchholz, M Kutrib
Acta Informatica 35, 329-252, 1998
521998
Cellular Automata and Language Theory.
M Kutrib
Encyclopedia of complexity and systems science, 800-823, 2009
452009
On stateless two-pushdown automata and restarting automata
M Kutrib, H Messerschmidt, F Otto
International Journal of Foundations of Computer Science 21 (05), 781-798, 2010
422010
The phenomenon of non-recursive trade-offs
M Kutrib
International Journal of Foundations of Computer Science 16 (05), 957-973, 2005
422005
Cellular automata–a computational point of view
M Kutrib
New developments in formal languages and applications, 183-227, 2008
392008
Some relations between massively parallel arrays
T Buchholz, M Kutrib
Parallel Computing 23 (11), 1643-1662, 1997
341997
Multi-head finite automata: Characterizations, concepts and open problems
M Holzer, M Kutrib, A Malcher
arXiv preprint arXiv:0906.3051, 2009
332009
Descriptional and computational complexity of finite automata
M Holzer, M Kutrib
International Conference on Language and Automata Theory and Applications, 23-42, 2009
302009
Fast reversible language recognition using cellular automata
M Kutrib, A Malcher
Information and Computation 206 (9-10), 1142-1151, 2008
302008
Recent trends in descriptional complexity of formal languages
M Kutrib, G Pighizzini
Bulletin of EATCS 3 (111), 2013
292013
More on the size of Higman-Haines sets: effective constructions
H Gruber, M Holzer, M Kutrib
Fundamenta Informaticae 91 (1), 105-121, 2009
292009
The system can't perform the operation now. Try again later.
Articles 1–20