Frantisek Mráz

According to our database, Frantisek Mráz authored at least 91 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Repetitive Finite Automata With Translucent Letters.

Frantisek Mráz, Friedrich Otto

CoRR, 2024

Non-Regularity of Complete CF(¢, $)-Grammars.

Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka

Proceedings of the 24th Conference Information Technologies, 2024

2023

Non-returning deterministic and nondeterministic finite automata with translucent letters.

Frantisek Mráz, Friedrich Otto

RAIRO Theor. Informatics Appl., 2023

One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars.

Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa

Proceedings of the 23rd Conference Information Technologies, 2023

2022

Recognizing Picture Languages by Reductions to String Languages.

Frantisek Mráz, Friedrich Otto

J. Autom. Lang. Comb., 2022

One-Way Restarting Automata and Their Sensitivitys.

Martin Plátek, Friedrich Otto, Frantisek Mráz

Int. J. Found. Comput. Sci., 2022

Non-Returning Finite Automata With Translucent Letters.

Frantisek Mráz, Friedrich Otto

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars.

Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa

Proceedings of the 22nd Conference Information Technologies, 2022

Learning Automata Using Dimensional Reduction.

David Kubon, Frantisek Mráz, Ivan Rychtera

Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2022, 2022

2021

Two-dimensional pattern matching against local and regular-like picture languages.

Frantisek Mráz, Daniel Prusa, Michael Wehar

Theor. Comput. Sci., 2021

Lexicalized Syntactic Analysis by Two-Way Restarting Automata.

Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek

J. Autom. Lang. Comb., 2021

On restarting automata with auxiliary symbols and small window size.

Frantisek Mráz, Friedrich Otto

RAIRO Theor. Informatics Appl., 2021

Preface.

Jorma Hirvensalo, Frantisek Mráz, Daniel Prusa

Fundam. Informaticae, 2021

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns.

Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma

Proceedings of the 21st Conference Information Technologies, 2021

2020

On h-Lexicalized Restarting List Automata.

Martin Plátek, Friedrich Otto, Frantisek Mráz

J. Autom. Lang. Comb., 2020

Pumping Deterministic Monotone Restarting Automata and DCFL.

Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma

Proceedings of the 20th Conference Information Technologies, 2020

Learning Picture Languages Represented as Strings.

David Kubon, Frantisek Mráz

Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

2019

How to Learn Picture Languages.

David Kubon, Frantisek Mráz

Res. Comput. Sci., 2019

Two-Dimensional Pattern Matching Against Basic Picture Languages.

Frantisek Mráz, Daniel Prusa, Michael Wehar

Proceedings of the Implementation and Application of Automata, 2019

Lexicalized Syntactic Analysis by Restarting Automata.

Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek

Proceedings of the Prague Stringology Conference 2019, 2019

Window size two suffices for deterministic monotone RWW-automata.

Frantisek Mráz, Friedrich Otto

Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

Lexically Syntactic Characterization by Restarting Automata.

Martin Plátek, Frantisek Mráz, Dana Pardubská

Proceedings of the 19th Conference Information Technologies, 2019

On Shrinking Restarting Automata of Window Size One and Two.

Frantisek Mráz, Friedrich Otto

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

On Deleting Deterministic Restarting Automata That Have Two Windows.

Frantisek Mráz, Friedrich Otto

J. Autom. Lang. Comb., 2018

Automata with cyclic move operations for picture languages.

Friedrich Otto, Frantisek Mráz

RAIRO Theor. Informatics Appl., 2018

Characterizations of LRR-languages by correctness-preserving computations.

Frantisek Mráz, Friedrich Otto, Martin Plátek

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

Robustness versus Sensibility by Two-Way Restarting Automata.

Martin Plátek, Dana Pardubská, Frantisek Mráz

Proceedings of the 18th Conference Information Technologies, 2018

2017

Regulated variants of limited context restarting automata.

Friedrich Otto, Frantisek Mráz

Theor. Comput. Sci., 2017

On h-Lexicalized Automata and h-Syntactic Analysis.

Martin Plátek, Friedrich Otto, Frantisek Mráz

Proceedings of the 17th Conference on Information Technologies, 2017

Deleting Deterministic Restarting Automata with Two Windows.

Frantisek Mráz, Friedrich Otto

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Some classes of rational functions for pictures.

Frantisek Mráz, Friedrich Otto, Daniel Prusa

RAIRO Theor. Informatics Appl., 2016

Two-Dimensional Limited Context Restarting Automata.

Lukás Krtek, Frantisek Mráz

Fundam. Informaticae, 2016

Cyclically extended variants of Sgraffito and restarting automata for picture languages.

Friedrich Otto, Frantisek Mráz

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015

Lambda-confluence for context rewriting systems.

Friedrich Otto, Frantisek Mráz

Theor. Comput. Sci., 2015

Deterministic ordered restarting automata for picture languages.

Friedrich Otto, Frantisek Mráz

Acta Informatica, 2015

On a class of rational functions for pictures.

Frantisek Mráz, Friedrich Otto, Daniel Prusa

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

2014

Two-dimensional Sgraffito automata.

Daniel Prusa, Frantisek Mráz, Friedrich Otto

RAIRO Theor. Informatics Appl., 2014

On the classes of languages accepted by limited context restarting automata.

Friedrich Otto, Peter Cerno, Frantisek Mráz

RAIRO Theor. Informatics Appl., 2014

Free Word-Order and Restarting Automata.

Frantisek Mráz, Friedrich Otto, Martin Plátek

Fundam. Informaticae, 2014

Ordered Restarting Automata for Picture Languages.

Frantisek Mráz, Friedrich Otto

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Limited restarting automata.

Frantisek Mráz

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Extended Two-Way Ordered Restarting Automata for Picture Languages.

Friedrich Otto, Frantisek Mráz

Proceedings of the Language and Automata Theory and Applications, 2014

2013

Restarting Tiling Automata.

Daniel Prusa, Frantisek Mráz

Int. J. Found. Comput. Sci., 2013

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata.

Daniel Prusa, Frantisek Mráz, Friedrich Otto

Proceedings of the Implementation and Application of Automata, 2013

Lambda-Confluence Is Undecidable for Clearing Restarting Automata.

Frantisek Mráz, Friedrich Otto

Proceedings of the Implementation and Application of Automata, 2013

New Results on Deterministic Sgraffito Automata.

Daniel Prusa, Frantisek Mráz, Friedrich Otto

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Limited Context Restarting Automata and McNaughton Families of Languages.

Friedrich Otto, Peter Cerno, Frantisek Mráz

Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Two-Dimensional Sgraffito Automata.

Daniel Prusa, Frantisek Mráz

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Translations by Regulated Parallel Communicating Grammar Systems.

Dana Pardubská, Frantisek Mráz, Martin Plátek

J. Autom. Lang. Comb., 2011

Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}.

Peter Cerno, Frantisek Mráz

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Clearing Restarting Automata.

Peter Cerno, Frantisek Mráz

Fundam. Informaticae, 2010

(In)Dependencies in Functional Generative Description by Restarting Automata.

Martin Plátek, Frantisek Mráz, Markéta Lopatková

Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

Restarting Automata with Structured Output and Functional Generative Description.

Martin Plátek, Frantisek Mráz, Markéta Lopatková

Proceedings of the Language and Automata Theory and Applications, 2010

Towards a formal model of natural language description based on restarting automata with parallel DR-structures.

Markéta Lopatková, Frantisek Mráz, Martin Plátek

Proceedings of the Conference on Theory and Practice of Information Technologies, 2010

On Lexicalized Well-Behaved Restarting Automata That Are Monotone.

Friedrich Otto, Martin Plátek, Frantisek Mráz

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages.

Frantisek Mráz, Friedrich Otto, Martin Plátek

Theor. Comput. Sci., 2009

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.

Martin Plátek, Friedrich Otto, Frantisek Mráz

Inf. Comput., 2009

2008

On the Complexity of 2-Monotone Restarting Automata.

Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek

Theory Comput. Syst., 2008

2007

Monotonicity of Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

J. Autom. Lang. Comb., 2007

Ambiguity by Restarting Automata.

Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski

Int. J. Found. Comput. Sci., 2007

A Measure for the Degree of Nondeterminism of Context-Free Languages.

Frantisek Mráz, Martin Plátek, Friedrich Otto

Proceedings of the Implementation and Application of Automata, 2007

Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.

Frantisek Mráz, Friedrich Otto, Martin Plátek

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2006

Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.

Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski

Theor. Comput. Sci., 2006

Degrees of non-monotonicity for restarting automata.

Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek

Theor. Comput. Sci., 2006

Correctness Preservation and Complexity of Simple RL-Automata.

Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek

Proceedings of the Implementation and Application of Automata, 2006

Learning Analysis by Reduction from Positive Data.

Frantisek Mráz, Friedrich Otto, Martin Plátek

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

On the Gap-Complexity of Simple RL-Automata.

Frantisek Mráz, Friedrich Otto, Martin Plátek

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Hierarchies of weakly monotone restarting automata.

Frantisek Mráz, Friedrich Otto

RAIRO Theor. Informatics Appl., 2005

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.

Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek

Fundam. Informaticae, 2005

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.

Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

On Left-Monotone Deterministic Restarting Automata.

Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek

Proceedings of the Developments in Language Theory, 2004

2003

Restarting Automata and Variants of j-Monotonicity.

Martin Plátek, Friedrich Otto, Frantisek Mráz

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2001

Lookahead Hierarchies of Restarting Automata.

Frantisek Mráz

J. Autom. Lang. Comb., 2001

Degrees of (Non)Monotonicity of RRW-Automata.

Martin Plátek, Frantisek Mráz

Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

2000

Restarting Automata, Deleting and Marcus Grammars.

Frantisek Mráz, Martin Plátek, Martin Procházka

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999

On Monotonic Automata with a Restart Operation.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

J. Autom. Lang. Comb., 1999

On Special Forms of Restarting Automata.

Frantisek Mráz, Martin Plátek, Martin Procházka

Grammars, 1999

1998

Pascal Subroutines for Solving Some problems in Interval LP.

Frantisek Mráz, Martin Kursch, Daniel Panuska

J. Univers. Comput. Sci., 1998

Calculating the exact bounds of optimal valuesin LP with interval coefficients.

Frantisek Mráz

Ann. Oper. Res., 1998

Different Types of Monotonicity for Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Monotonic Rewriting Automata with a Restart Operation.

Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Deleting Automata with a Restart Operation and Marcus Grammars.

Frantisek Mráz, Martin Plátek, Martin Procházka

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Deleting Automata with a Restart Operation.

Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the New Trends in Formal Languages, 1997

1996

Forgetting Automata and Context-Free Languages.

Petr Jancar, Frantisek Mráz, Martin Plátek

Acta Informatica, 1996

Restarting Automata with Rewriting.

Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995

Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Restarting Automata, Marcus Grammars and Context-Free Languages.

Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel

Proceedings of the Developments in Language Theory II, 1995

1993

A Taxonomy of Forgetting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Characterization of Context-Free Languages by Erasing Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1990

Local minimizer of a nonconvex quadratic programming problem.

Frantisek Mráz

Computing, 1990