Printable version

Global QuickSearch:   Number of matches: 84/84

Search Settings

BibTeX-Key Author / Editor / Organization Title Year Journal / Proceedings / Book BibTeX type Keywords
ChM90 Chytil, M. & Mráz, F. Bartošek, M. (Hrsg.) Complexity of Parallel Computations 1990 SOFSEM'90 , pp. 157-186   inproceedings
BibTeX:
@inproceedings{ChM90,
  author = {Michal Chytil and František Mráz},
  title = {Complexity of Parallel Computations},
  booktitle = {SOFSEM'90},
  year = {1990},
  pages = {157--186},
  note = {In Slovak}
}
					
ChMSV89 Chytil, M.; Mráz, F.; Škarvada, L. & Vašín, M. Bartošek, M. (Hrsg.) Parallel computation of an error distance 1989 SOFSEM'89 , pp. 27-30   inproceedings
BibTeX:
@inproceedings{ChMSV89,
  author = {Michal Chytil and František Mráz and Libor Škarvada and Marek Vašín},
  title = {Parallel computation of an error distance},
  booktitle = {SOFSEM'89},
  year = {1989},
  pages = {27--30},
  note = {In Slovak}
}
					
JMPV07 Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Monotonicity of Restarting Automata 2007 Journal of Automata, Languages and Combinatorics
Vol. 12 (3) , pp. 355-371  
article
BibTeX:
@article{JMPV07,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Monotonicity of Restarting Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {2007},
  volume = {12},
  number = {3},
  pages = {355--371}
}
					
JMP92sof Jančar, P.; Mráz, F. & Plátek, M. Bartošek, M. (Hrsg.) Forgetting automata and the Chomsky hierarchy 1992 SOFSEM'92, Contributed talks , pp. 41-44   inproceedings
BibTeX:
@inproceedings{JMP92sof,
  author = {Petr Jančar and František Mráz and Martin Plátek},
  title = {Forgetting automata and the Chomsky hierarchy},
  booktitle = {SOFSEM'92, Contributed talks},
  year = {1992},
  pages = {41--44}
}
					
JMP93 Jančar, P.; Mráz, F. & Plátek, M. Borzyszkowski, A.M. & Sokolowski, S. (Hrsg.) A Taxonomy of Forgetting Automata 1993
Vol. 711 Mathematical Foundations of Computer Science 1993, 18th International Symposium , pp. 527-536  
inproceedings
BibTeX:
@inproceedings{JMP93,
  author = {Petr Jančar and František Mráz and Martin Plátek},
  title = {A Taxonomy of Forgetting Automata},
  booktitle = {Mathematical Foundations of Computer Science 1993, 18th International Symposium},
  publisher = {Springer},
  year = {1993},
  volume = {711},
  pages = {527--536}
}
					
JMP92 Jančar, P.; Mráz, F. & Plátek, M. Havel, I.M. & Koubek, V. (Hrsg.) Characterization of Context-Free Languages by Erasing Automata 1992
Vol. 629 Mathematical Foundations of Computer Science 1992, 17th International Symposium , pp. 307-314  
inproceedings
BibTeX:
@inproceedings{JMP92,
  author = {Petr Jančar and František Mráz and Martin Plátek},
  title = {Characterization of Context-Free Languages by Erasing Automata},
  booktitle = {Mathematical Foundations of Computer Science 1992, 17th International Symposium},
  publisher = {Springer},
  year = {1992},
  volume = {629},
  pages = {307--314}
}
					
JMP96 Jančar, P.; Mráz, F. & Plátek, M. Forgetting Automata and Context-Free Languages 1996 Acta Informatica
Vol. 33 (5) , pp. 409-420  
article
BibTeX:
@article{JMP96,
  author = {Petr Jančar and František Mráz and Martin Plátek},
  title = {Forgetting Automata and Context-Free Languages},
  journal = {Acta Informatica},
  year = {1996},
  volume = {33},
  number = {5},
  pages = {409--420}
}
					
JMP93p Jančar, P.; Mráz, F. & Plátek, M. A Taxonomy of Forgetting Automata 1993 (101)   techreport
BibTeX:
@techreport{JMP93p,
  author = {Petr Jančar and František Mráz and Martin Plátek},
  title = {A Taxonomy of Forgetting Automata},
  year = {1993},
  number = {101},
  note = {17 pages}
}
					
JMP92p Jančar, P.; Mráz, F. & Plátek, M. Characterization of Context-Free Languages by Erasing Automata 1992 (99)   techreport
BibTeX:
@techreport{JMP92p,
  author = {Petr Jančar and František Mráz and Martin Plátek},
  title = {Characterization of Context-Free Languages by Erasing Automata},
  year = {1992},
  number = {99},
  note = {9 pages}
}
					
JMPPV98 Jančar, P.; Mráz, F.; Plátek, M.; Procházka, M. & Vogel, J. Bozapalidis, S. (Hrsg.) Deleting Automata with a Restart Operation 1998 Developments in Language Theory, 1997 , pp. 191-202   inproceedings
BibTeX:
@inproceedings{JMPPV98,
  author = {Petr Jančar and František Mráz and Martin Plátek and Martin Procházka and Jörg Vogel},
  title = {Deleting Automata with a Restart Operation},
  booktitle = {Developments in Language Theory, 1997},
  publisher = {University of Thessaloniki},
  year = {1998},
  pages = {191--202}
}
					
JMPPV96 Jančar, P.; Mráz, F.; Plátek, M.; Procházka, M. & Vogel, J. Dassow, J.; Rozenberg, G. & Salomaa, A. (Hrsg.) Restarting Automata, Marcus Grammars and Context-Free Languages 1996 Developments in Language Theory II , pp. 102-111   inproceedings
BibTeX:
@inproceedings{JMPPV96,
  author = {Petr Jančar and František Mráz and Martin Plátek and Martin Procházka and Jörg Vogel},
  title = {Restarting Automata, Marcus Grammars and Context-Free Languages},
  booktitle = {Developments in Language Theory II},
  publisher = {World Scientific Publ.},
  year = {1996},
  pages = {102--111}
}
					
JMPPV97p Jančar, P.; Mráz, F.; Plátek, M.; Procházka, M. & Vogel, J. Deleting Automata with a Restart Operation 1997 (97/2)   techreport
BibTeX:
@techreport{JMPPV97p,
  author = {Petr Jančar and František Mráz and Martin Plátek and Martin Procházka and Jörg Vogel},
  title = {Deleting Automata with a Restart Operation},
  year = {1997},
  number = {97/2},
  note = {12 pages}
}
					
JMPPV95j Jančar, P.; Mráz, F.; Plátek, M.; Procházka, M. & Vogel, J. Restarting Automata and Marcus Grammars 1995 (Math/95/1)   techreport
BibTeX:
@techreport{JMPPV95j,
  author = {Petr Jančar and František Mráz and Martin Plátek and Martin Procházka and Jörg Vogel},
  title = {Restarting Automata and Marcus Grammars},
  year = {1995},
  number = {Math/95/1},
  note = {11 pages}
}
					
JMPV98 Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Arvind, V. & Ramanujam, R. (Hrsg.) Different Types of Monotonicity for Restarting Automata 1998
Vol. 1530 FSTsl &TCS'98 , pp. 343-354  
inproceedings
BibTeX:
@inproceedings{JMPV98,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Different Types of Monotonicity for Restarting Automata},
  booktitle = {FSTsl &TCS'98},
  publisher = {Springer},
  year = {1998},
  volume = {1530},
  pages = {343--354}
}
					
JMPV98a Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Kudlek, M. (Hrsg.) On Monotony for Restarting Automata 1998 `Mathematical Linguistics' Workshop Proceedings , pp. 71-84   inproceedings
BibTeX:
@inproceedings{JMPV98a,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {On Monotony for Restarting Automata},
  booktitle = {`Mathematical Linguistics' Workshop Proceedings},
  publisher = {Universität Hamburg, Fachbereich Informatik},
  year = {1998},
  pages = {71--84}
}
					
JMPV97 Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Paun, G. & Salomaa, A. (Hrsg.) On Restarting Automata with Rewriting 1997
Vol. 1218 New Trends in Formal Language Theory (Control, Cooperation and Combinatorics) , pp. 119-136  
incollection
BibTeX:
@incollection{JMPV97,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {On Restarting Automata with Rewriting},
  booktitle = {New Trends in Formal Language Theory (Control, Cooperation and Combinatorics)},
  publisher = {Springer},
  year = {1997},
  volume = {1218},
  pages = {119--136}
}
					
JMPV95 Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Reichel, H. (Hrsg.) Restarting Automata 1995
Vol. 965 FCT'95 , pp. 283-292  
inproceedings
BibTeX:
@inproceedings{JMPV95,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Restarting Automata},
  booktitle = {FCT'95},
  publisher = {Springer},
  year = {1995},
  volume = {965},
  pages = {283--292}
}
					
JMPV02j Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Monotonicity on restarting automata 2002 (Math/Inf/02/01)   techreport
BibTeX:
@techreport{JMPV02j,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Monotonicity on restarting automata},
  year = {2002},
  number = {Math/Inf/02/01},
  note = {12 pages}
}
					
JMPV99 Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. On Monotonic Automata with a Restart Operation 1999 Journal of Automata, Languages and Combinatorics
Vol. 4 (4) , pp. 287-311  
article
BibTeX:
@article{JMPV99,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {On Monotonic Automata with a Restart Operation},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {1999},
  volume = {4},
  number = {4},
  pages = {287--311}
}
					
JMPV98j Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Different Types of Monotonicity for Restarting Automata 1998 (Math/Inf/98/15)   techreport
BibTeX:
@techreport{JMPV98j,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Different Types of Monotonicity for Restarting Automata},
  year = {1998},
  number = {Math/Inf/98/15},
  note = {15 pages}
}
					
JMPV96p Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. On Restarting Automata with Rewriting 1996 (96/5)   techreport
BibTeX:
@techreport{JMPV96p,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {On Restarting Automata with Rewriting},
  year = {1996},
  number = {96/5},
  note = {21 pages}
}
					
JMPV94j Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Restarting Automata 1994 (Math/94/8)   techreport
BibTeX:
@techreport{JMPV94j,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Restarting Automata},
  year = {1994},
  number = {Math/94/8},
  note = {12 pages}
}
					
JMPV94p Jančar, P.; Mráz, F.; Plátek, M. & Vogel, J. Deleting Automata with a Restart Operation 1994 (105)   techreport
BibTeX:
@techreport{JMPV94p,
  author = {Petr Jančar and František Mráz and Martin Plátek and Jörg Vogel},
  title = {Deleting Automata with a Restart Operation},
  year = {1994},
  number = {105},
  note = {13 pages}
}
					
JMOP05cai Jurdziński, T.; Mráz, F.; Otto, F. & Plátek, M. Bozapalidis, S.; Kalampakas, A. & Rahonis, G. (Hrsg.) Cut hierarchies for restarting automata and Marcus t-contextual grammars 2005 Proceedings of the 1st International Confernce on Agebraic Informatics , pp. 157-172   inproceedings
BibTeX:
@inproceedings{JMOP05cai,
  author = {Tomasz Jurdziński and František Mráz and Friedrich Otto and Martin Plátek},
  title = {Cut hierarchies for restarting automata and Marcus t-contextual grammars},
  booktitle = {Proceedings of the 1st International Confernce on Agebraic Informatics},
  publisher = {Aristotle University of Thessaloniki},
  year = {2005},
  pages = {157--172}
}
					
JMOP06 Jurdziński, T.; Mráz, F.; Otto, F. & Plátek, M. Degrees of non-monotonicity for restarting automata 2006 Theoretical Computer Science
Vol. 369 (1-3) , pp. 1-34  
article
Abstract: In the literature various notions of monotonicity for restarting automata have been studied. Here we introduce two new variants of monotonicity for restarting automata and for two-way restarting automata: left-monotonicity and right-left-monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without auxiliary symbols, these notions yield infinite hierarchies, and we compare these hierarchies to each other. Further, as a tool used to simplify some of the proofs, the shrinking restarting automaton is introduced, which is a generalization of the standard (length-reducing) restarting automaton to the weight-reducing case. Some of the consequences of this generalization are also discussed.
BibTeX:
@article{JMOP06,
  author = {Tomasz Jurdziński and František Mráz and Friedrich Otto and Martin Plátek},
  title = {Degrees of non-monotonicity for restarting automata},
  journal = {Theoretical Computer Science},
  year = {2006},
  volume = {369},
  number = {1--3},
  pages = {1--34}
}
					
JMOP05 Jurdziński, T.; Mráz, F.; Otto, F. & Plátek, M. Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars 2005 Fundamenta Informaticae
Vol. 64 (1-4) , pp. 217-228  
article
BibTeX:
@article{JMOP05,
  author = {Tomasz Jurdziński and František Mráz and Friedrich Otto and Martin Plátek},
  title = {Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars},
  journal = {Fundamenta Informaticae},
  year = {2005},
  volume = {64},
  number = {1--4},
  pages = {217--228}
}
					
JMOP04t21 Jurdziński, T.; Mráz, F.; Otto, F. & Plátek, M. Cut hierarchies for restarting automata and Marcus t-contextual grammars 2004 (21/04)   techreport
BibTeX:
@techreport{JMOP04t21,
  author = {Tomasz Jurdziński and František Mráz and Friedrich Otto and Martin Plátek},
  title = {Cut hierarchies for restarting automata and Marcus t-contextual grammars},
  year = {2004},
  number = {21/04},
  note = {23 pages}
}
					
JOMP04comp Jurdziński, T.; Otto, F.; Mráz, F. & Plátek, M. Calude, C.; Calude, E. & Dinneen, M. (Hrsg.) On the Complexity of 2-Monotone Restarting Automata 2004
Vol. 3340 Developments in Language Theory, Proceedings DLT 2004 , pp. 237-248  
inproceedings
BibTeX:
@inproceedings{JOMP04comp,
  author = {Tomasz Jurdziński and Friedrich Otto and František Mráz and Martin Plátek},
  title = {On the Complexity of 2-Monotone Restarting Automata},
  booktitle = {Developments in Language Theory, Proceedings DLT 2004},
  publisher = {Springer-Verlag},
  year = {2004},
  volume = {3340},
  pages = {237--248}
}
					
JOMP04leftmon Jurdziński, T.; Otto, F.; Mráz, F. & Plátek, M. Calude, C.; Calude, E. & Dinneen, M. (Hrsg.) On left-monotone deterministic restarting automata 2004
Vol. 3340 Developments in Language Theory, Proceedings DLT 2004 , pp. 249-260  
inproceedings
BibTeX:
@inproceedings{JOMP04leftmon,
  author = {Tomasz Jurdziński and Friedrich Otto and František Mráz and Martin Plátek},
  title = {On left-monotone deterministic restarting automata},
  booktitle = {Developments in Language Theory, Proceedings DLT 2004},
  publisher = {Springer-Verlag},
  year = {2004},
  volume = {3340},
  pages = {249--260}
}
					
JOMP05dlt Jurdziński, T.; Otto, F.; Mráz, F. & Plátek, M. Felice, C.D. & Restivo, A. (Hrsg.) Monotone deterministic RL-automata don't need auxiliary symbols 2005
Vol. 3572 Developments in Language Theory, Proceedings DLT 2005 , pp. 284-295  
inproceedings
BibTeX:
@inproceedings{JOMP05dlt,
  author = {Tomasz Jurdziński and Friedrich Otto and František Mráz and Martin Plátek},
  title = {Monotone deterministic RL-automata don't need auxiliary symbols},
  booktitle = {Developments in Language Theory, Proceedings DLT 2005},
  publisher = {Springer-Verlag},
  year = {2005},
  volume = {3572},
  pages = {284--295}
}
					
JOMP08 Jurdziński, T.; Otto, F.; Mráz, F. & Plátek, M. On the Complexity of 2-Monotone Restarting Automata 2008 Theory of Computing Systems
Vol. 42 (4) , pp. 488-518  
article
BibTeX:
@article{JOMP08,
  author = {Tomasz Jurdziński and Friedrich Otto and František Mráz and Martin Plátek},
  title = {On the Complexity of 2-Monotone Restarting Automata},
  journal = {Theory of Computing Systems},
  year = {2008},
  volume = {42},
  number = {4},
  pages = {488--518},
  doi = {http://dx.doi.org/10.1007/s00224-007-9004-y}
}
					
JOMP04t4 Jurdziński, T.; Otto, F.; Mráz, F. & Plátek, M. On the Complexity of 2-Monotone Restarting Automata 2004 (4/04)   techreport
BibTeX:
@techreport{JOMP04t4,
  author = {Tomasz Jurdziński and Friedrich Otto and František Mráz and Martin Plátek},
  title = {On the Complexity of 2-Monotone Restarting Automata},
  year = {2004},
  number = {4/04}
}
					
JOMP04t7 Jurdziński, T.; Otto, F.; Mráz, F. & Plátek, M. Deterministic Two-Way Restarting Automata Don't Need Auxiliary Symbols If They Are (Right-, Left-, Right-Left-) Monotone 2004 (7/04)   techreport
BibTeX:
@techreport{JOMP04t7,
  author = {Tomasz Jurdziński and Friedrich Otto and František Mráz and Martin Plátek},
  title = {Deterministic Two-Way Restarting Automata Don't Need Auxiliary Symbols If They Are (Right-, Left-, Right-Left-) Monotone},
  year = {2004},
  number = {7/04}
}
					
MMOP06ciaa Messerschmidt, H.; Mráz, F.; Otto, F. & Plátek, M. Ibarra, O.H. & Yen, H.-C. (Hrsg.) Correctness preservation and complexity of simple RL-automata 2006
Vol. 4094 Proceedings CIAA 2006 , pp. 162-172  
inproceedings
BibTeX:
@inproceedings{MMOP06ciaa,
  author = {Hartmut Messerschmidt and František Mráz and Friedrich Otto and Martin Plátek},
  title = {Correctness preservation and complexity of simple RL-automata},
  booktitle = {Proceedings CIAA 2006},
  publisher = {Springer-Verlag},
  year = {2006},
  volume = {4094},
  pages = {162--172}
}
					
MMOP06t4 Messerschmidt, H.; Mráz, F.; Otto, F. & Plátek, M. On the descriptional complexity of simple RL-automata 2006 (4/06)   techreport
BibTeX:
@techreport{MMOP06t4,
  author = {Hartmut Messerschmidt and František Mráz and Friedrich Otto and Martin Plátek},
  title = {On the descriptional complexity of simple RL-automata},
  year = {2006},
  number = {4/06},
  note = {13 pages},
  url = {https://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2006110215424}
}
					
M89 Mráz, F. Bartošek, M. (Hrsg.) Parallel algorithms for reduction of finite automata 1989 SOFSEM'89 , pp. 49-52   inproceedings
BibTeX:
@inproceedings{M89,
  author = {František Mráz},
  title = {Parallel algorithms for reduction of finite automata},
  booktitle = {SOFSEM'89},
  year = {1989},
  pages = {49--52},
  note = {In Slovak}
}
					
M00 Mráz, F. Boldt, O. & Jürgensen, H. (Hrsg.) Lookahead Hierarchies of Restarting Automata 2000 Pre-Proceedings of DCAGRS 2000 Descriptional Complexity of Automata, Grammars and Related Structures , pp. 1-15   inproceedings
BibTeX:
@inproceedings{M00,
  author = {František Mráz},
  title = {Lookahead Hierarchies of Restarting Automata},
  booktitle = {Pre-Proceedings of DCAGRS 2000 Descriptional Complexity of Automata, Grammars and Related Structures},
  publisher = {Dept. of Comp. Science, The University of Western Ontario, London, Canada},
  year = {2000},
  pages = {1--15},
  note = {As Report No. 255. Extended version of teM01.}
}
					
M01 Mráz, F. Lookahead Hierarchies of Restarting Automata 2001 Journal of Automata, Languages and Combinatorics
Vol. 6 (4) , pp. 493-506  
article
BibTeX:
@article{M01,
  author = {František Mráz},
  title = {Lookahead Hierarchies of Restarting Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {2001},
  volume = {6},
  number = {4},
  pages = {493--506}
}
					
M01phd Mráz, F. Forgetting and restarting automata 2001 School: Charles University   phdthesis 
Abstract: 
BibTeX:
@phdthesis{M01phd,
  author = {František Mráz},
  title = {Forgetting and restarting automata},
  school = {Charles University},
  year = {2001}
}
					
MO03TT Mráz, F. & Otto, F. Holzer, M. (Hrsg.) Hierarchies of weakly monotone restarting automata 2003 Workshop ``Petrinetze'' und 13. Theorietag ``Automaten und Formale Sprachen'' , pp. 83-89   incollection
BibTeX:
@incollection{MO03TT,
  author = {František Mráz and Friedrich Otto},
  title = {Hierarchies of weakly monotone restarting automata},
  booktitle = {Workshop ``Petrinetze'' und 13. Theorietag ``Automaten und Formale Sprachen''},
  publisher = {Institut für Informatik, Technishe Universität München},
  year = {2003},
  pages = {83--89}
}
					
MO05 Mráz, F. & Otto, F. Hierarchies of weakly monotone restarting automata 2005 RAIRO - Theoretical Informatics and Applications
Vol. 39 (2) , pp. 325-342  
article
Abstract: It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
BibTeX:
@article{MO05,
  author = {František Mráz and Friedrich Otto},
  title = {Hierarchies of weakly monotone restarting automata},
  journal = {RAIRO -- Theoretical Informatics and Applications},
  year = {2005},
  volume = {39},
  number = {2},
  pages = {325--342}
}
					
MO03t Mráz, F. & Otto, F. Hierarchies of weakly monotone restarting automata 2003 (8/03) School: Fachbereich Mathematik/Informatik   techreport
BibTeX:
@techreport{MO03t,
  author = {František Mráz and Friedrich Otto},
  title = {Hierarchies of weakly monotone restarting automata},
  school = {Fachbereich Mathematik/Informatik},
  year = {2003},
  number = {8/03}
}
					
MOP07mcu Mráz, F.; Otto, F. & Plátek, M. Durand-Lose, J.O. & Margenstern, M. (Hrsg.) Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata 2007
Vol. 4664 Proceedings MCU 2007 , pp. 230-241  
inproceedings
Abstract: A nondeterministic restarting automaton M is said to be (strongly) correctness preserving, if, for each cycle u M^c v, the word v belongs to the complete language L_C(M) accepted by M, if the word u does. Here, in order to differentiate between nondeterministic restarting automata that are correctness preserving and nondeterministic restarting automata in general we introduce two gradual relaxations of the correctness preserving property. These relaxations lead to an infinite twodimensional hierarchy of classes of languages with membership problems that are decidable in polynomial time.
BibTeX:
@inproceedings{MOP07mcu,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata},
  booktitle = {Proceedings MCU 2007},
  publisher = {Springer},
  year = {2007},
  volume = {4664},
  pages = {230--241}
}
					
MOP05tagi Mráz, F.; Otto, F. & Plátek, M. Fernau, H. (Hrsg.) Learning analysis by reduction from positive data 2005 Theoretical Aspects of Grammar Induction , pp. 22-25   incollection
BibTeX:
@incollection{MOP05tagi,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Learning analysis by reduction from positive data},
  booktitle = {Theoretical Aspects of Grammar Induction},
  publisher = {Wilhem-Schickard-Institut für Informatik, University Tübingen},
  year = {2005},
  pages = {22-25},
  note = {WSI-2005-14}
}
					
MOP05tt Mráz, F.; Otto, F. & Plátek, M. Fernau, H. (Hrsg.) Parametrized syntactic analysis by freely rewriting restarting automata 2005 15. Theorietag der GI Fachgruppe 0.1.5 Automaten und Formalen Sprachen , pp. 45-48   incollection
BibTeX:
@incollection{MOP05tt,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Parametrized syntactic analysis by freely rewriting restarting automata},
  booktitle = {15. Theorietag der GI Fachgruppe 0.1.5 Automaten und Formalen Sprachen},
  publisher = {Wilhem-Schickard-Institut für Informatik, University Tübingen},
  year = {2005},
  pages = {45--48},
  note = {WSI-2005-16}
}
					
MOP06dlt Mráz, F.; Otto, F. & Plátek, M. Ibarra, O.H. & Dang, Z. (Hrsg.) On the gap-complexity of simple RL-automata 2006
Vol. 4036 Developments in Language Theory, Proceedings DLT 2006 , pp. 83-94  
inproceedings
Abstract: Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-sRLautomaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-sRL-automata with an unbounded number of gaps accept NP-complete languages.
BibTeX:
@inproceedings{MOP06dlt,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {On the gap-complexity of simple RL-automata},
  booktitle = {Developments in Language Theory, Proceedings DLT 2006},
  publisher = {Springer},
  year = {2006},
  volume = {4036},
  pages = {83--94}
}
					
MOP07lataprep Mráz, F.; Otto, F. & Plátek, M. Loos, R.; Fazekas, S.Z. & Martín-Vide, C. (Hrsg.) Free Word-Order and Restarting Automata 2007 Pre-proceedings of LATA 2007 , pp. 425-436   inproceedings
Abstract: In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valences do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of jmonotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: the degree of j-monotonicity, and the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with di.erent degrees of word-order freedom and word-order complexity.
BibTeX:
@inproceedings{MOP07lataprep,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Free Word-Order and Restarting Automata},
  booktitle = {Pre-proceedings of LATA 2007},
  publisher = {Universitat Rovira I Virgili},
  year = {2007},
  pages = {425--436}
}
					
MOP06icgi Mráz, F.; Otto, F. & Plátek, M. Sakakibara, Y.; Kobayashi, S.; Sato, K.; Nishino, T. & Tomita, E. (Hrsg.) Learning analysis by reduction from positive data 2006
Vol. 4201 Proceedings ICGI 2006 , pp. 125-136  
inproceedings
Abstract: Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of languages accepted by SLT-R-automata with respect to the Chomsky hierarchy.
BibTeX:
@inproceedings{MOP06icgi,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Learning analysis by reduction from positive data},
  booktitle = {Proceedings ICGI 2006},
  publisher = {Springer},
  year = {2006},
  volume = {4201},
  pages = {125--136}
}
					
MOP03ITAT Mráz, F.; Otto, F. & Plátek, M. Vojtáš, P. (Hrsg.) P.~J.~Šafárik University Restarting automata and combinations of constraints 2003 Proc. of ITAT 2003 , pp. 83-91   inproceedings
BibTeX:
@inproceedings{MOP03ITAT,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Restarting automata and combinations of constraints},
  booktitle = {Proc. of ITAT 2003},
  year = {2003},
  pages = {83--91}
}
					
MOP09 Mráz, F.; Otto, F. & Plátek, M. The Degree of Word-Expansion of Lexicalized RRWW-Automata - A New Measure for The Degree of Nondeterminism of (Context-Free) Languages 2009 Theoretical Computer Science
Vol. 410 (37) , pp. 3530-3538  
article
Abstract: Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a method used in linguistics for the creation and verification of formal descriptions of natural languages. Our main results establish a hierarchy of classes of context-free languages and two hierarchies of classes of non-context-free languages that are based on the expansion factor of a language.
BibTeX:
@article{MOP09,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {The Degree of Word-Expansion of Lexicalized RRWW-Automata - A New Measure for The Degree of Nondeterminism of (Context-Free) Languages},
  journal = {Theoretical Computer Science},
  year = {2009},
  volume = {410},
  number = {37},
  pages = {3530--3538}
}
					
MOP07ciaatcsTR Mráz, F.; Otto, F. & Plátek, M. The Degree of Word-Expansion of Lexicalized RRWW-Automata - A New Measure for The Degree of Nondeterminism of (Context-Free) Languages 2007 (5/2007) School: Fachbereich Elektrotechnik/Informatik   techreport
Abstract: Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a method used in linguistics for the creation and verification of formal descriptions of natural languages. Our main results establish a hierarchy of classes of context-free languages and two hierarchies of classes of non-context-free languages that are based on the expansion factor of a language.
BibTeX:
@techreport{MOP07ciaatcsTR,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {The Degree of Word-Expansion of Lexicalized RRWW-Automata - A New Measure for The Degree of Nondeterminism of (Context-Free) Languages},
  school = {Fachbereich Elektrotechnik/Informatik},
  year = {2007},
  number = {5/2007},
  url = {https://kobra.bibliothek.uni-kassel.de/handle/ urn:nbn:de:hebis:34-2007112619730}
}
					
MOP06t2 Mráz, F.; Otto, F. & Plátek, M. On the Gap-Complexity of Simple RL-Automata 2006 (2/06)   techreport
BibTeX:
@techreport{MOP06t2,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {On the Gap-Complexity of Simple RL-Automata},
  year = {2006},
  number = {2/06},
  note = {13 pages},
  url = {https://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2006053112600}
}
					
MOP05t5 Mráz, F.; Otto, F. & Plátek, M. Degrees of Free Word-Order and Freely Rewriting Restarting Automata 2005 (5/05)   techreport
BibTeX:
@techreport{MOP05t5,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Degrees of Free Word-Order and Freely Rewriting Restarting Automata},
  year = {2005},
  number = {5/05}
}
					
MOP05t7 Mráz, F.; Otto, F. & Plátek, M. Learning analysis by reduction from positive data 2005 (7/05)   techreport
BibTeX:
@techreport{MOP05t7,
  author = {František Mráz and Friedrich Otto and Martin Plátek},
  title = {Learning analysis by reduction from positive data},
  year = {2005},
  number = {7/05}
}
					
MOPJ06 Mráz, F.; Otto, F.; Plátek, M. & Jurdziński, T. Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata 2006 Theoretical Computer Science
Vol. 366 (3) , pp. 272-296  
article
Abstract: The t -contextual grammars are generalizations of Marcus contextual grammars, which insert t contexts in each derivation step. If the selection mappings are regular and satisfy an additional locality restriction, then these grammars correspond in their expressive power to restarting automata with cut-index t . In the first part of the paper classes of languages are studied that are accepted by certain types of restarting automata with limited cut-index. As already R-automata with cut-index 1 accept NP-complete languages, additional restrictions in the form of certain monotonicity conditions are also considered.Without the locality restriction t-contextual grammars with regular selection correspond to t -RR-automata with cut-index one. These areRR-automata that are allowed to perform up to t deletion operations in each cycle that each delete a single factor only. In the second part of the paper the expressive power of these automata is studied, where the focus is on the special case that certain monotonicity conditions are satisfied.
BibTeX:
@article{MOPJ06,
  author = {František Mráz and Friedrich Otto and Martin Plátek and Tomasz Jurdziński},
  title = {Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata},
  journal = {Theoretical Computer Science},
  year = {2006},
  volume = {366},
  number = {3},
  pages = {272--296}
}
					
MP95 Mráz, F. & Plátek, M. Erasing Automata Recognize More Than Context-Free Languages 1995 Acta Mathematica et Informatica Universitatis Ostraviensis
Vol. 3 , pp. 77-85  
article
BibTeX:
@article{MP95,
  author = {František Mráz and Martin Plátek},
  title = {Erasing Automata Recognize More Than Context-Free Languages},
  journal = {Acta Mathematica et Informatica Universitatis Ostraviensis},
  year = {1995},
  volume = {3},
  pages = {77--85}
}
					
MP93 Mráz, F. & Plátek, M. A Remark About Forgetting Automata 1993 SOFSEM'93 , pp. 63-66   inproceedings
BibTeX:
@inproceedings{MP93,
  author = {František Mráz and Martin Plátek},
  title = {A Remark About Forgetting Automata},
  booktitle = {SOFSEM'93},
  year = {1993},
  pages = {63--66}
}
					
MP91 Mráz, F. & Plátek, M. Erasing Automata Recognize More Than Context-Free Languages 1991 SOFSEM'91 , pp. 251-255   inproceedings
BibTeX:
@inproceedings{MP91,
  author = {František Mráz and Martin Plátek},
  title = {Erasing Automata Recognize More Than Context-Free Languages},
  booktitle = {SOFSEM'91},
  year = {1991},
  pages = {251--255}
}
					
MP91p Mráz, F. & Plátek, M. Erasing Automata Recognize More Than Context-Free Languages 1991 (90)   techreport
BibTeX:
@techreport{MP91p,
  author = {František Mráz and Martin Plátek},
  title = {Erasing Automata Recognize More Than Context-Free Languages},
  year = {1991},
  number = {90},
  note = {7 pages}
}
					
MPJV97 Mráz, F.; Plátek, M.; Jančar, P. & Vogel, J. Plášil, F. & Jeffery, K.G. (Hrsg.) Monotonic Rewriting Automata with a Restart Operation 1997
Vol. 1338 SOFSEM'97 , pp. 505-512  
inproceedings
BibTeX:
@inproceedings{MPJV97,
  author = {František Mráz and Martin Plátek and Petr Jančar and Jörg Vogel},
  title = {Monotonic Rewriting Automata with a Restart Operation},
  booktitle = {SOFSEM'97},
  publisher = {Springer},
  year = {1997},
  volume = {1338},
  pages = {505--512}
}
					
MPJV97p Mráz, F.; Plátek, M.; Jančar, P. & Vogel, J. Monotonic Rewriting Automata with a Restart Operation 1997 (97/6)   techreport
BibTeX:
@techreport{MPJV97p,
  author = {František Mráz and Martin Plátek and Petr Jančar and Jörg Vogel},
  title = {Monotonic Rewriting Automata with a Restart Operation},
  year = {1997},
  number = {97/6},
  note = {8 pages}
}
					
MPJu07ijfcs Mráz, F.; Plátek, M. & Jurdziński, T. Ambiguity by restarting automata 2007 International Journal of Foundations of Computer Science
Vol. 18 (6) , pp. 1343-1352  
article
BibTeX:
@article{MPJu07ijfcs,
  author = {František Mráz and Martin Plátek and Tomasz Jurdziński},
  title = {Ambiguity by restarting automata},
  journal = {International Journal of Foundations of Computer Science},
  year = {2007},
  volume = {18},
  number = {6},
  pages = {1343--1352}
}
					
MPO07ciaa Mráz, F.; Plátek, M. & Otto, F. Holub, J. & Žďárek, J. (Hrsg.) A Measure for The Degree of Nondeterminism of Context-free Languages 2007 Proceedings of CIAA 2007 , pp. 192-202   inproceedings
BibTeX:
@inproceedings{MPO07ciaa,
  author = {František Mráz and Martin Plátek and Friedrich Otto},
  title = {A Measure for The Degree of Nondeterminism of Context-free Languages},
  booktitle = {Proceedings of CIAA 2007},
  publisher = {Springer},
  year = {2007},
  pages = {192--202}
}
					
MPP98 Mráz, F.; Plátek, M. & Procházka, M. Bozapalidis, S. (Hrsg.) Deleting Automata with a Restart Operation and Marcus Grammars 1998 Developments in Language Theory, 1997 , pp. 329-342   inproceedings
BibTeX:
@inproceedings{MPP98,
  author = {František Mráz and Martin Plátek and Martin Procházka},
  title = {Deleting Automata with a Restart Operation and Marcus Grammars},
  booktitle = {Developments in Language Theory, 1997},
  publisher = {University of Thessaloniki},
  year = {1998},
  pages = {329--342}
}
					
MPPk00 Mráz, F.; Plátek, M. & Procházka, M. C. Martín-Vide, V.M. (Hrsg.) On special forms of restarting automata 2000 Words, sequences, grammars, languages: where biology, computer science, linguistics and mathematics meet I , pp. 149-160   incollection
BibTeX:
@incollection{MPPk00,
  author = {František Mráz and Martin Plátek and Martin Procházka},
  title = {On special forms of restarting automata},
  booktitle = {Words, sequences, grammars, languages: where biology, computer science, linguistics and mathematics meet I},
  publisher = {Kluwer},
  year = {2000},
  pages = {149--160}
}
					
MPP00 Mráz, F.; Plátek, M. & Procházka, M. Martín-Vide, C. & Paun, G. (Hrsg.) Restarting Automata, Deleting, and Marcus Grammars 2000 Recent topics in mathematical and computational linguistics , pp. 218-233   incollection
BibTeX:
@incollection{MPP00,
  author = {František Mráz and Martin Plátek and Martin Procházka},
  title = {Restarting Automata, Deleting, and Marcus Grammars},
  booktitle = {Recent topics in mathematical and computational linguistics},
  publisher = {The Publishing House of the Romanian Academy},
  year = {2000},
  pages = {218--233}
}
					
MPP99 Mráz, F.; Plátek, M. & Procházka, M. On Special Forms of Restarting Automata 1999 Grammars
Vol. 2 (3) , pp. 223-233  
article
BibTeX:
@article{MPP99,
  author = {František Mráz and Martin Plátek and Martin Procházka},
  title = {On Special Forms of Restarting Automata},
  journal = {Grammars},
  year = {1999},
  volume = {2},
  number = {3},
  pages = {223--233}
}
					
MPP97p Mráz, F.; Plátek, M. & Procházka, M. Deleting Automata with a Restart Operation and Marcus Grammars 1997 (97/3)   techreport
BibTeX:
@techreport{MPP97p,
  author = {František Mráz and Martin Plátek and Martin Procházka},
  title = {Deleting Automata with a Restart Operation and Marcus Grammars},
  year = {1997},
  number = {97/3},
  note = {11 pages}
}
					
MPV96 Mráz, F.; Plátek, M. & Vogel, J. Jeffery, K.G.; Král, J. & Bartošek, M. (Hrsg.) Restarting Automata with Rewriting 1996
Vol. 1175 Theory and Practice of Informatics, SOFSEM'96 , pp. 401-408  
inproceedings
BibTeX:
@inproceedings{MPV96,
  author = {František Mráz and Martin Plátek and Jörg Vogel},
  title = {Restarting Automata with Rewriting},
  booktitle = {Theory and Practice of Informatics, SOFSEM'96},
  publisher = {Springer},
  year = {1996},
  volume = {1175},
  pages = {401--408}
}
					
MM01 Mrázová, I. & Mráz, F. Andrejková, G. & Krajči, S. (Hrsg.) Data Mining and Neural Networks 2001 ITAT´2001: Information Technologies -- Applications and Theory   inproceedings
BibTeX:
@inproceedings{MM01,
  author = {Iveta Mrázová and František Mráz},
  title = {Data Mining and Neural Networks},
  booktitle = {ITAT´2001: Information Technologies -- Applications and Theory},
  publisher = {Dept. of Comp. Science, Pavol Jozef Šafárik University},
  year = {2001}
}
					
MMRP08 Mrázová, I.; Mráz, F.; Reitermanová, Z. & Petříček, M. et al., C.H.D. (Hrsg.) Phonetic Search in Foreign Texts 2008 Intelligent Engineering Systems though Artificial Neural Networks (Proc. of ANNIE 2008, Nov. 9-12, St. Louis, USA) , pp. 533-540   inproceedings
BibTeX:
@inproceedings{MMRP08,
  author = {Iveta Mrázová and František Mráz and Zuzana Reitermanová and Martin Petříček},
  title = {Phonetic Search in Foreign Texts},
  booktitle = {Intelligent Engineering Systems though Artificial Neural Networks (Proc. of ANNIE 2008, Nov. 9-12, St. Louis, USA)},
  year = {2008},
  pages = {533--540}
}
					
OMP05 Otto, F.; Mráz, F. & Plátek, M. Ésik, Z. & Fülöp, Z. (Hrsg.) Institute of Informatics, University of Szeged Degrees of monotonicity and Marcus t-contextual grammars 2005 Automata and Formal Languages, Proceedings AFL 2005 , pp. 249-262   inproceedings
BibTeX:
@inproceedings{OMP05,
  author = {Friedrich Otto and František Mráz and Martin Plátek},
  title = {Degrees of monotonicity and Marcus t-contextual grammars},
  booktitle = {Automata and Formal Languages, Proceedings AFL 2005},
  year = {2005},
  pages = {249--262}
}
					
PM01 Plátek, M. & Mráz, F. Dassow, J. & Wotschke, D. (Hrsg.) Degrees of (non)monotonicity of RRWW-automata 2001 Pre-Proceedings of DCAGRS 2001 Descriptional Complexity of Automata, Grammars and Related Structures , pp. 159-165   inproceedings
BibTeX:
@inproceedings{PM01,
  author = {Martin Plátek and František Mráz},
  title = {Degrees of (non)monotonicity of RRWW-automata},
  booktitle = {Pre-Proceedings of DCAGRS 2001 Descriptional Complexity of Automata, Grammars and Related Structures},
  publisher = {Fakultät für informatik, Otto-von-Guericke Universität, Magdeburg},
  year = {2001},
  pages = {159--165},
  note = {As Report No. 16}
}
					
PML10ncma Plátek, M.; Mráz, F. & Lopatková, M. Bordinh, H.; Freund, R.; Hinze, T.; Holzer, M.; Kutrib, M. & Otto, F. (Hrsg.) (In)dependencies in Functional Generative Description by Restarting Automata 2010
Vol. 263 Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010) , pp. 155-170  
inproceedings
BibTeX:
@inproceedings{PML10ncma,
  author = {Martin Plátek and Frantisek Mráz and Markéta Lopatková},
  title = {(In)dependencies in Functional Generative Description by Restarting Automata},
  booktitle = {Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010)},
  publisher = {Österreichisches Computer Gesellschaft},
  year = {2010},
  volume = {263},
  pages = {155--170}
}
					
PML10 Plátek, M.; Mráz, F. & Lopatková, M. Dediu, A.-H.; Fernau, H. & Matín-Vide, C. (Hrsg.) Restarting Automata with Structured Output and Functional Generative Description 2010
Vol. 6031 LATA 2010 , pp. 500-511  
inproceedings
BibTeX:
@inproceedings{PML10,
  author = {Martin Plátek and Frantisek Mráz and Markéta Lopatková},
  title = {Restarting Automata with Structured Output and Functional Generative Description},
  booktitle = {LATA 2010},
  publisher = {Springer},
  year = {2010},
  volume = {6031},
  pages = {500--511}
}
					
PML10itat Plátek, M.; Mráz, F. & Lopatková, M. Towards a formal model of natural language description based on restarting automata with parallel DR-structures 2010   unpublished
BibTeX:
@unpublished{PML10itat,
  author = {Martin Plátek and Frantisek Mráz and Markéta Lopatková},
  title = {Towards a formal model of natural language description based on restarting automata with parallel DR-structures},
  year = {2010},
  note = {Accepted to ITAT 2010}
}
					
PMOL05 Plátek, M.; Mráz, F.; Otto, F. & Lopatková, M. Vojtáš, P. (Hrsg.) Department of Computer Science, Faculty of Science O roztržitosti a volnosti slovosledu pomocí restartovacích automatů 2005 ITAT 2005, Information Technologies -- Applications and Theory, Proc. , pp. 145-155   inproceedings
BibTeX:
@inproceedings{PMOL05,
  author = {Martin Plátek and František Mráz and Friedrich Otto and Markéta Lopatková},
  title = {O roztržitosti a volnosti slovosledu pomocí restartovacích automatů},
  booktitle = {ITAT 2005, Information Technologies -- Applications and Theory, Proc.},
  publisher = {Pavol Jozef Šafárik University},
  year = {2005},
  pages = {145--155},
  note = {In Czech, Eng. translation: On discontinuity and freenes of word-order by restarting automata}
}
					
POM03 Plátek, M.; Otto, F. & Mráz, F. Csuhaj-Varjú, E.; Kintala, C.; Wotschke, D. & Vaszil, G. (Hrsg.) Restarting Automata and Variants of j-Monotonicity 2003 Proceedings of DCFS 2003 Descriptional Complexity of Formal Systems , pp. 303-312   inproceedings
BibTeX:
@inproceedings{POM03,
  author = {Martin Plátek and Friedrich Otto and František Mráz},
  title = {Restarting Automata and Variants of j-Monotonicity},
  booktitle = {Proceedings of DCFS 2003 Descriptional Complexity of Formal Systems},
  publisher = {MTA SZTAKI, Budapest},
  year = {2003},
  pages = {303--312}
}
					
POM09 Plátek, M.; Otto, F. & Mráz, F. Two-dimensional hierarchies of proper languages of lexicalized FRR-automata 2009 Inf. Comput.
Vol. 207 (11) , pp. 1300-1314  
article
BibTeX:
@article{POM09,
  author = {Martin Plátek and Friedrich Otto and Frantisek Mráz},
  title = {Two-dimensional hierarchies of proper languages of lexicalized FRR-automata},
  journal = {Inf. Comput.},
  year = {2009},
  volume = {207},
  number = {11},
  pages = {1300-1314}
}
					
POMJ03 Plátek, M.; Otto, F.; Mráz, F. & Jurdzińnski, T. Restarting automata and variants of $j$-monotonicity 2003 (9/03) School: Fachbereich Mathematik/Informatik   techreport
BibTeX:
@techreport{POMJ03,
  author = {Martin Plátek and Friedrich Otto and František Mráz and Tomasz Jurdzińnski},
  title = {Restarting automata and variants of $j$-monotonicity},
  school = {Fachbereich Mathematik/Informatik},
  year = {2003},
  number = {9/03}
}
					
PrM00 Průša, D. & Mráz, F. Svoboda, T. (Hrsg.) Parallel Turing Machines on a Two-Dimensional Tape 2000 Proceedings of the Czech Pattern Recognition Workshop 2000 , pp. 155-160   inproceedings
BibTeX:
@inproceedings{PrM00,
  author = {Daniel Průša and František Mráz},
  title = {Parallel Turing Machines on a Two-Dimensional Tape},
  booktitle = {Proceedings of the Czech Pattern Recognition Workshop 2000},
  publisher = {Czech Pattern Recognition Society},
  year = {2000},
  pages = {155--160},
  note = {ISBN 80-238-5215-9}
}
					
CM09 Černo, P. & Mráz, F. Bordinh, H.; Freund, R.; Holzer, M.; Kutrib, M. & Otto, F. (Hrsg.) Clearing restarting automata 2009
Vol. 256 Workshop on Non-Classical Models for Automata and Applications (NCMA) , pp. 77-90  
inproceedings
BibTeX:
@inproceedings{CM09,
  author = {Peter Černo and František Mráz},
  title = {Clearing restarting automata},
  booktitle = {Workshop on Non-Classical Models for Automata and Applications (NCMA)},
  publisher = {Österreichisches Computer Gesellschaft},
  year = {2009},
  volume = {256},
  pages = {77--90},
  note = {An extended version of the paper was accepted for publication in Fundamenta Informaticae}
}
					
CM10 Černo, P. & Mráz, F. Clearing restarting automata 2010 Fundamenta Informaticae   article
BibTeX:
@article{CM10,
  author = {Peter Černo and František Mráz},
  title = {Clearing restarting automata},
  journal = {Fundamenta Informaticae},
  year = {2010},
  note = {Accepted for publication in July 2010}
}
					
CM09techrep Černo, P. & Mráz, F. Clearing restarting automata 2009 (2010/6)   techreport
BibTeX:
@techreport{CM09techrep,
  author = {Peter Černo and František Mráz},
  title = {Clearing restarting automata},
  year = {2009},
  number = {2010/6}
}