Frantisek Mráz

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 31

Top Topics

Picture Languages

Finite Automata

Finite State Automata

Top Venues

RAIRO Theor. Informatics Appl.

J. Autom. Lang. Comb.

Publications

Frantisek Mráz, Friedrich Otto
Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO Theor. Informatics Appl. 57 (2023)
Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT (2023)
Martin Plátek, Friedrich Otto, Frantisek Mráz
One-Way Restarting Automata and Their Sensitivitys. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Frantisek Mráz, Friedrich Otto
Non-Returning Finite Automata With Translucent Letters. NCMA (2022)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT (2022)
David Kubon, Frantisek Mráz, Ivan Rychtera
Learning Automata Using Dimensional Reduction. IBERAMIA (2022)
Frantisek Mráz, Friedrich Otto
Recognizing Picture Languages by Reductions to String Languages. J. Autom. Lang. Comb. 27 (1-3) (2022)
Frantisek Mráz, Daniel Prusa, Michael Wehar
Two-dimensional pattern matching against local and regular-like picture languages. Theor. Comput. Sci. 870 (2021)
Jorma Hirvensalo, Frantisek Mráz, Daniel Prusa
Preface. Fundam. Informaticae 180 (1-2) (2021)
Frantisek Mráz, Friedrich Otto
On restarting automata with auxiliary symbols and small window size. RAIRO Theor. Informatics Appl. 55 (2021)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma
On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. ITAT (2021)
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
Lexicalized Syntactic Analysis by Two-Way Restarting Automata. J. Autom. Lang. Comb. 26 (1-2) (2021)
Martin Plátek, Friedrich Otto, Frantisek Mráz
On h-Lexicalized Restarting List Automata. J. Autom. Lang. Comb. 25 (2-3) (2020)
David Kubon, Frantisek Mráz
Learning Picture Languages Represented as Strings. FLAIRS Conference (2020)
Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT (2020)
Frantisek Mráz, Daniel Prusa, Michael Wehar
Two-Dimensional Pattern Matching Against Basic Picture Languages. CIAA (2019)
Frantisek Mráz, Friedrich Otto
Window size two suffices for deterministic monotone RWW-automata. NCMA (2019)
Martin Plátek, Frantisek Mráz, Dana Pardubská
Lexically Syntactic Characterization by Restarting Automata. ITAT (2019)
David Kubon, Frantisek Mráz
How to Learn Picture Languages. Res. Comput. Sci. 148 (11) (2019)
Frantisek Mráz, Friedrich Otto
On Shrinking Restarting Automata of Window Size One and Two. DLT (2019)
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
Lexicalized Syntactic Analysis by Restarting Automata. Stringology (2019)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Characterizations of LRR-languages by correctness-preserving computations. NCMA (2018)
Frantisek Mráz, Friedrich Otto
On Deleting Deterministic Restarting Automata That Have Two Windows. J. Autom. Lang. Comb. 23 (4) (2018)
Martin Plátek, Dana Pardubská, Frantisek Mráz
Robustness versus Sensibility by Two-Way Restarting Automata. ITAT (2018)
Friedrich Otto, Frantisek Mráz
Automata with cyclic move operations for picture languages. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Frantisek Mráz, Friedrich Otto
Deleting Deterministic Restarting Automata with Two Windows. DLT (2017)
Friedrich Otto, Frantisek Mráz
Regulated variants of limited context restarting automata. Theor. Comput. Sci. 682 (2017)
Martin Plátek, Friedrich Otto, Frantisek Mráz
On h-Lexicalized Automata and h-Syntactic Analysis. ITAT (2017)
Frantisek Mráz, Friedrich Otto, Daniel Prusa
Some classes of rational functions for pictures. RAIRO Theor. Informatics Appl. 50 (4) (2016)
Lukás Krtek, Frantisek Mráz
Two-Dimensional Limited Context Restarting Automata. Fundam. Informaticae 148 (3-4) (2016)
Friedrich Otto, Frantisek Mráz
Cyclically extended variants of Sgraffito and restarting automata for picture languages. NCMA (2016)
Friedrich Otto, Frantisek Mráz
Lambda-confluence for context rewriting systems. Theor. Comput. Sci. 578 (2015)
Frantisek Mráz, Friedrich Otto, Daniel Prusa
On a class of rational functions for pictures. NCMA (2015)
Friedrich Otto, Frantisek Mráz
Deterministic ordered restarting automata for picture languages. Acta Informatica 52 (7-8) (2015)
Frantisek Mráz
Limited restarting automata. NCMA (2014)
Frantisek Mráz, Friedrich Otto
Ordered Restarting Automata for Picture Languages. SOFSEM (2014)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Free Word-Order and Restarting Automata. Fundam. Informaticae 133 (4) (2014)
Friedrich Otto, Frantisek Mráz
Extended Two-Way Ordered Restarting Automata for Picture Languages. LATA (2014)
Friedrich Otto, Peter Cerno, Frantisek Mráz
On the classes of languages accepted by limited context restarting automata. RAIRO Theor. Informatics Appl. 48 (1) (2014)
Lukás Krtek, Frantisek Mráz
Two-dimensional limited context restarting automata. NCMA (2014)
Daniel Prusa, Frantisek Mráz, Friedrich Otto
Two-dimensional Sgraffito automata. RAIRO Theor. Informatics Appl. 48 (5) (2014)
Daniel Prusa, Frantisek Mráz, Friedrich Otto
New Results on Deterministic Sgraffito Automata. Developments in Language Theory (2013)
Daniel Prusa, Frantisek Mráz, Friedrich Otto
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. CIAA (2013)
Daniel Prusa, Frantisek Mráz
Restarting Tiling Automata. Int. J. Found. Comput. Sci. 24 (6) (2013)
Frantisek Mráz, Friedrich Otto
Lambda-Confluence Is Undecidable for Clearing Restarting Automata. CIAA (2013)
Daniel Prusa, Frantisek Mráz
Two-Dimensional Sgraffito Automata. Developments in Language Theory (2012)
Daniel Prusa, Frantisek Mráz
Restarting Tiling Automata. CIAA (2012)
Friedrich Otto, Peter Cerno, Frantisek Mráz
Limited Context Restarting Automata and McNaughton Families of Languages. NCMA (2012)
Peter Cerno, Frantisek Mráz
Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}. Developments in Language Theory (2011)
Dana Pardubská, Frantisek Mráz, Martin Plátek
Translations by Regulated Parallel Communicating Grammar Systems. J. Autom. Lang. Comb. 16 (2-4) (2011)
Martin Plátek, Frantisek Mráz, Markéta Lopatková
(In)Dependencies in Functional Generative Description by Restarting Automata. NCMA (2010)
Peter Cerno, Frantisek Mráz
Clearing Restarting Automata. Fundam. Informaticae 104 (1-2) (2010)
Friedrich Otto, Martin Plátek, Frantisek Mráz
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. Developments in Language Theory (2010)
Martin Plátek, Frantisek Mráz, Markéta Lopatková
Restarting Automata with Structured Output and Functional Generative Description. LATA (2010)
Markéta Lopatková, Frantisek Mráz, Martin Plátek
Towards a formal model of natural language description based on restarting automata with parallel DR-structures. ITAT (2010)
Peter Cerno, Frantisek Mráz
Clearing Restarting Automata. NCMA (2009)
Frantisek Mráz, Friedrich Otto, Martin Plátek
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. Theor. Comput. Sci. 410 (37) (2009)
Martin Plátek, Friedrich Otto, Frantisek Mráz
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. Inf. Comput. 207 (11) (2009)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
On the Complexity of 2-Monotone Restarting Automata. Theory Comput. Syst. 42 (4) (2008)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Free Word-Order and Restarting Automata. LATA (2007)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. MCU (2007)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
Monotonicity of Restarting Automata. J. Autom. Lang. Comb. 12 (3) (2007)
Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski
Ambiguity by Restarting Automata. Int. J. Found. Comput. Sci. 18 (6) (2007)
Frantisek Mráz, Martin Plátek, Friedrich Otto
A Measure for the Degree of Nondeterminism of Context-Free Languages. CIAA (2007)
Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek
Correctness Preservation and Complexity of Simple RL-Automata. CIAA (2006)
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
Degrees of non-monotonicity for restarting automata. Theor. Comput. Sci. 369 (1-3) (2006)
Frantisek Mráz, Friedrich Otto, Martin Plátek
On the Gap-Complexity of Simple RL-Automata. Developments in Language Theory (2006)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Learning Analysis by Reduction from Positive Data. ICGI (2006)
Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. Theor. Comput. Sci. 366 (3) (2006)
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. Developments in Language Theory (2005)
Frantisek Mráz, Friedrich Otto
Hierarchies of weakly monotone restarting automata. RAIRO Theor. Informatics Appl. 39 (2) (2005)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Informaticae 64 (1-4) (2005)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
On the Complexity of 2-Monotone Restarting Automata. Developments in Language Theory (2004)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory (2004)
Martin Plátek, Friedrich Otto, Frantisek Mráz
Restarting Automata and Variants of j-Monotonicity. DCFS (2003)
Frantisek Mráz
Lookahead Hierarchies of Restarting Automata. J. Autom. Lang. Comb. 6 (4) (2001)
Martin Plátek, Frantisek Mráz
Degrees of (Non)Monotonicity of RRW-Automata. DCFS (2001)
Frantisek Mráz, Martin Plátek, Martin Procházka
On special forms of restarting automata. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Frantisek Mráz, Martin Plátek, Martin Procházka
Restarting Automata, Deleting and Marcus Grammars. Recent Topics in Mathematical and Computational Linguistics (2000)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4 (4) (1999)
Frantisek Mráz, Martin Plátek, Martin Procházka
On Special Forms of Restarting Automata. Grammars 2 (3) (1999)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
Different Types of Monotonicity for Restarting Automata. FSTTCS (1998)
Frantisek Mráz, Martin Kursch, Daniel Panuska
Pascal Subroutines for Solving Some problems in Interval LP. J. Univers. Comput. Sci. 4 (2) (1998)
Frantisek Mráz
Calculating the exact bounds of optimal valuesin LP with interval coefficients. Ann. Oper. Res. 81 (1998)
Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel
Monotonic Rewriting Automata with a Restart Operation. SOFSEM (1997)
Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
Deleting Automata with a Restart Operation. Developments in Language Theory (1997)
Frantisek Mráz, Martin Plátek, Martin Procházka
Deleting Automata with a Restart Operation and Marcus Grammars. Developments in Language Theory (1997)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
On Restarting Automata with Rewriting. New Trends in Formal Languages (1997)
Petr Jancar, Frantisek Mráz, Martin Plátek
Forgetting Automata and Context-Free Languages. Acta Informatica 33 (5) (1996)
Frantisek Mráz, Martin Plátek, Jörg Vogel
Restarting Automata with Rewriting. SOFSEM (1996)
Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
Restarting Automata, Marcus Grammars and Context-Free Languages. Developments in Language Theory (1995)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
Restarting Automata. FCT (1995)
Petr Jancar, Frantisek Mráz, Martin Plátek
A Taxonomy of Forgetting Automata. MFCS (1993)
Petr Jancar, Frantisek Mráz, Martin Plátek
Characterization of Context-Free Languages by Erasing Automata. MFCS (1992)
Frantisek Mráz
Local minimizer of a nonconvex quadratic programming problem. Computing 45 (3) (1990)