Frantisek Mráz

According to our database1, Frantisek Mráz
  • authored at least 68 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Regulated variants of limited context restarting automata.
Theor. Comput. Sci., 2017

Deleting Deterministic Restarting Automata with Two Windows.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016
Some classes of rational functions for pictures.
RAIRO - Theor. Inf. and Applic., 2016

Two-Dimensional Limited Context Restarting Automata.
Fundam. Inform., 2016

Cyclically extended variants of Sgraffito and restarting automata for picture languages.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015
Lambda-confluence for context rewriting systems.
Theor. Comput. Sci., 2015

Deterministic ordered restarting automata for picture languages.
Acta Inf., 2015

On a class of rational functions for pictures.
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.
RAIRO - Theor. Inf. and Applic., 2014

On the classes of languages accepted by limited context restarting automata.
RAIRO - Theor. Inf. and Applic., 2014

Free Word-Order and Restarting Automata.
Fundam. Inform., 2014

Ordered Restarting Automata for Picture Languages.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

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

Two-dimensional limited context restarting automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Extended Two-Way Ordered Restarting Automata for Picture Languages.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Restarting Tiling Automata.
Int. J. Found. Comput. Sci., 2013

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata.
Proceedings of the Implementation and Application of Automata, 2013

Lambda-Confluence Is Undecidable for Clearing Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2013

New Results on Deterministic Sgraffito Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Restarting Tiling Automata.
Proceedings of the Implementation and Application of Automata, 2012

Limited Context Restarting Automata and McNaughton Families of Languages.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Two-Dimensional Sgraffito Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Translations by Regulated Parallel Communicating Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2011

Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Clearing Restarting Automata.
Fundam. Inform., 2010

(In)Dependencies in Functional Generative Description by Restarting Automata.
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.
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.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2010

On Lexicalized Well-Behaved Restarting Automata That Are Monotone.
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.
Theor. Comput. Sci., 2009

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.
Inf. Comput., 2009

Clearing Restarting Automata.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

2008
On the Complexity of 2-Monotone Restarting Automata.
Theory Comput. Syst., 2008

2007
Monotonicity of Restarting Automata.
Journal of Automata, Languages and Combinatorics, 2007

Ambiguity by Restarting Automata.
Int. J. Found. Comput. Sci., 2007

A Measure for the Degree of Nondeterminism of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2007

Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Free Word-Order and Restarting Automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Degrees of non-monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Correctness Preservation and Complexity of Simple RL-Automata.
Proceedings of the Implementation and Application of Automata, 2006

Learning Analysis by Reduction from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

On the Gap-Complexity of Simple RL-Automata.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Hierarchies of weakly monotone restarting automata.
ITA, 2005

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Fundam. Inform., 2005

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
On Left-Monotone Deterministic Restarting Automata.
Proceedings of the Developments in Language Theory, 2004

On the Complexity of 2-Monotone Restarting Automata.
Proceedings of the Developments in Language Theory, 2004

2003
Restarting Automata and Variants of j-Monotonicity.
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.
Journal of Automata, Languages and Combinatorics, 2001

Degrees of (Non)Monotonicity of RRW-Automata.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

On special forms of restarting automata.
Proceedings of the Where Mathematics, 2001

2000
Restarting Automata, Deleting and Marcus Grammars.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
On Monotonic Automata with a Restart Operation.
Journal of Automata, Languages and Combinatorics, 1999

On Special Forms of Restarting Automata.
Grammars, 1999

1998
Pascal Subroutines for Solving Some problems in Interval LP.
J. UCS, 1998

Different Types of Monotonicity for Restarting Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
Monotonic Rewriting Automata with a Restart Operation.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Deleting Automata with a Restart Operation and Marcus Grammars.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Deleting Automata with a Restart Operation.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.
Proceedings of the New Trends in Formal Languages, 1997

1996
Forgetting Automata and Context-Free Languages.
Acta Inf., 1996

Restarting Automata with Rewriting.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

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

Restarting Automata, Marcus Grammars and Context-Free Languages.
Proceedings of the Developments in Language Theory II, 1995

1993
A Taxonomy of Forgetting Automata.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Characterization of Context-Free Languages by Erasing Automata.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1990
Local minimizer of a nonconvex quadratic programming problem.
Computing, 1990


  Loading...