Frantisek Mráz

108 papers A* 1B 6C 23Misc 2Journal 40Unranked 30
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Unifying Approach to Picture Automata.
CoRR
Yvo Ad Meeres, Frantisek Mráz
2025 A* conf
Locally Connected Echo State Networks for Time Series Forecasting.
ICLR
Filip Matzner, Frantisek Mráz
2025 — conf
On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words.
DCFS
Frantisek Mráz, Friedrich Otto
2025 — conf
On Repetitive Finite Automata with Translucent Words.
NCMA
Frantisek Mráz, Friedrich Otto
2024 — conf
Non-Regularity of Complete CF(¢, $)-Grammars.
ITAT
Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka
2024 J jnl
Parallel CPU- and GPU-based connected component algorithms for event building for hybrid pixel detectors.
CoRR
Tomás Celko, Frantisek Mráz, Benedikt Bergmann, Petr Mánek
2024 — ed.
Proceedings of the 24th Conference Information Technologies - Applications and Theory (ITAT 2024), Drienica, Slovakia, September 20-24, 2024.
ITAT
Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Martin Macaj, Frantisek Mráz, Richard Ostertág, Dana Pardubská, Martin Plátek, Martin Stanek
2024 — conf
Repetitive Finite Automata With Translucent Letters.
NCMA
Frantisek Mráz, Friedrich Otto
2023 J jnl
Non-returning deterministic and nondeterministic finite automata with translucent letters.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto
2023 — conf
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars.
ITAT
Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa
2023 — ed.
Proceedings of the 23rd Conference Information Technologies - Applications and Theory (ITAT 2023), Tatranské Matliare, Slovakia, September 22-26, 2023.
ITAT
Brona Brejová, Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Matej Lexa, Frantisek Mráz, Dana Pardubská, Martin Plátek
2022 — conf
Learning Automata Using Dimensional Reduction.
IBERAMIA
David Kubon, Frantisek Mráz, Ivan Rychtera
2022 — conf
Non-Returning Finite Automata With Translucent Letters.
NCMA
Frantisek Mráz, Friedrich Otto
2022 — conf
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars.
ITAT
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa
2022 J jnl
One-Way Restarting Automata and Their Sensitivitys.
Int. J. Found. Comput. Sci.
Martin Plátek, Friedrich Otto, Frantisek Mráz
2022 — ed.
Proceedings of the 22nd Conference Information Technologies - Applications and Theory (ITAT 2022), Zuberec, Slovakia, September 23-27, 2022.
ITAT
Lucie Ciencialová, Martin Holena, Robert Jajcay, Tatiana Jajcayová, Frantisek Mráz, Dana Pardubská, Martin Plátek
2022 J jnl
Recognizing Picture Languages by Reductions to String Languages.
J. Autom. Lang. Comb.
Frantisek Mráz, Friedrich Otto
2021 J jnl
Lexicalized Syntactic Analysis by Two-Way Restarting Automata.
J. Autom. Lang. Comb.
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
2021 — conf
On Separations of LR(0)-Grammars by Two Types of Pumping Patterns.
ITAT
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma
2021 J jnl
On restarting automata with auxiliary symbols and small window size.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto
2021 J jnl
Preface.
Fundam. Informaticae
Jorma Hirvensalo, Frantisek Mráz, Daniel Prusa
2021 — ed.
Proceedings of the 21st Conference Information Technologies - Applications and Theory (ITAT 2021), Hotel Heľpa, Nízke Tatry and Muránska planina, Slovakia, September 24-28, 2021.
ITAT
Brona Brejová, Lucie Ciencialová, Martin Holena, Frantisek Mráz, Dana Pardubská, Martin Plátek, Tomás Vinar
2021 J jnl
Two-dimensional pattern matching against local and regular-like picture languages.
Theor. Comput. Sci.
Frantisek Mráz, Daniel Prusa, Michael Wehar
2020 Misc conf
Learning Picture Languages Represented as Strings.
FLAIRS
David Kubon, Frantisek Mráz
2020 J jnl
On h-Lexicalized Restarting List Automata.
J. Autom. Lang. Comb.
Martin Plátek, Friedrich Otto, Frantisek Mráz
2020 — ed.
Proceedings of the 20th Conference Information Technologies - Applications and Theory (ITAT 2020), Hotel Tyrapol, Oravská Lesná, Slovakia, September 18-22, 2020.
ITAT
Martin Holena, Tomás Horváth, Alica Kelemenová, Frantisek Mráz, Dana Pardubská, Martin Plátek, Petr Sosík
2020 — conf
Pumping Deterministic Monotone Restarting Automata and DCFL.
ITAT
Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma
2019 J jnl
How to Learn Picture Languages.
Res. Comput. Sci.
David Kubon, Frantisek Mráz
2019 Misc conf
Lexicalized Syntactic Analysis by Restarting Automata.
PSC
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
2019 — conf
Lexically Syntactic Characterization by Restarting Automata.
ITAT
Martin Plátek, Frantisek Mráz, Dana Pardubská
2019 C conf
On Shrinking Restarting Automata of Window Size One and Two.
DLT
Frantisek Mráz, Friedrich Otto
2019 C conf
Two-Dimensional Pattern Matching Against Basic Picture Languages.
CIAA
Frantisek Mráz, Daniel Prusa, Michael Wehar
2019 — conf
Window size two suffices for deterministic monotone RWW-automata.
NCMA
Frantisek Mráz, Friedrich Otto
2018 J jnl
Automata with cyclic move operations for picture languages.
RAIRO Theor. Informatics Appl.
Friedrich Otto, Frantisek Mráz
2018 — conf
Characterizations of LRR-languages by correctness-preserving computations.
NCMA
Frantisek Mráz, Friedrich Otto, Martin Plátek
2018 J jnl
On Deleting Deterministic Restarting Automata That Have Two Windows.
J. Autom. Lang. Comb.
Frantisek Mráz, Friedrich Otto
2018 — conf
Robustness versus Sensibility by Two-Way Restarting Automata.
ITAT
Martin Plátek, Dana Pardubská, Frantisek Mráz
2017 C conf
Deleting Deterministic Restarting Automata with Two Windows.
DLT
Frantisek Mráz, Friedrich Otto
2017 — ed.
Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017.
NCMA
Rudolf Freund, Frantisek Mráz, Daniel Prusa
2017 — conf
On h-Lexicalized Automata and h-Syntactic Analysis.
ITAT
Martin Plátek, Friedrich Otto, Frantisek Mráz
2017 J jnl
Regulated variants of limited context restarting automata.
Theor. Comput. Sci.
Friedrich Otto, Frantisek Mráz
2016 — conf
Cyclically extended variants of Sgraffito and restarting automata for picture languages.
NCMA
Friedrich Otto, Frantisek Mráz
2016 J jnl
Some classes of rational functions for pictures.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto, Daniel Prusa
2016 J jnl
Two-Dimensional Limited Context Restarting Automata.
Fundam. Informaticae
Lukás Krtek, Frantisek Mráz
2015 J jnl
Deterministic ordered restarting automata for picture languages.
Acta Informatica
Friedrich Otto, Frantisek Mráz
2015 J jnl
Lambda-confluence for context rewriting systems.
Theor. Comput. Sci.
Friedrich Otto, Frantisek Mráz
2015 — conf
On a class of rational functions for pictures.
NCMA
Frantisek Mráz, Friedrich Otto, Daniel Prusa
2014 C conf
Extended Two-Way Ordered Restarting Automata for Picture Languages.
LATA
Friedrich Otto, Frantisek Mráz
2014 J jnl
Free Word-Order and Restarting Automata.
Fundam. Informaticae
Frantisek Mráz, Friedrich Otto, Martin Plátek
2014 — conf
Limited restarting automata.
NCMA
Frantisek Mráz
2014 J jnl
On the classes of languages accepted by limited context restarting automata.
RAIRO Theor. Informatics Appl.
Friedrich Otto, Peter Cerno, Frantisek Mráz
2014 B conf
Ordered Restarting Automata for Picture Languages.
SOFSEM
Frantisek Mráz, Friedrich Otto
2014 J jnl
Two-dimensional Sgraffito automata.
RAIRO Theor. Informatics Appl.
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2014 — conf
Two-dimensional limited context restarting automata.
NCMA
Lukás Krtek, Frantisek Mráz
2013 C conf
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata.
CIAA
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2013 C conf
Lambda-Confluence Is Undecidable for Clearing Restarting Automata.
CIAA
Frantisek Mráz, Friedrich Otto
2013 C conf
New Results on Deterministic Sgraffito Automata.
Developments in Language Theory
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2013 J jnl
Restarting Tiling Automata.
Int. J. Found. Comput. Sci.
Daniel Prusa, Frantisek Mráz
2012 — conf
Limited Context Restarting Automata and McNaughton Families of Languages.
NCMA
Friedrich Otto, Peter Cerno, Frantisek Mráz
2012 C conf
Restarting Tiling Automata.
CIAA
Daniel Prusa, Frantisek Mráz
2012 C conf
Two-Dimensional Sgraffito Automata.
Developments in Language Theory
Daniel Prusa, Frantisek Mráz
2011 J jnl
Translations by Regulated Parallel Communicating Grammar Systems.
J. Autom. Lang. Comb.
Dana Pardubská, Frantisek Mráz, Martin Plátek
2011 C conf
Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}.
Developments in Language Theory
Peter Cerno, Frantisek Mráz
2010 — conf
(In)Dependencies in Functional Generative Description by Restarting Automata.
NCMA
Martin Plátek, Frantisek Mráz, Markéta Lopatková
2010 J jnl
Clearing Restarting Automata.
Fundam. Informaticae
Peter Cerno, Frantisek Mráz
2010 C conf
On Lexicalized Well-Behaved Restarting Automata That Are Monotone.
Developments in Language Theory
Friedrich Otto, Martin Plátek, Frantisek Mráz
2010 C conf
Restarting Automata with Structured Output and Functional Generative Description.
LATA
Martin Plátek, Frantisek Mráz, Markéta Lopatková
2010 — conf
Towards a formal model of natural language description based on restarting automata with parallel DR-structures.
ITAT
Markéta Lopatková, Frantisek Mráz, Martin Plátek
2009 — conf
Clearing Restarting Automata.
NCMA
Peter Cerno, Frantisek Mráz
2009 J jnl
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages.
Theor. Comput. Sci.
Frantisek Mráz, Friedrich Otto, Martin Plátek
2009 J jnl
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.
Inf. Comput.
Martin Plátek, Friedrich Otto, Frantisek Mráz
2008 J jnl
On the Complexity of 2-Monotone Restarting Automata.
Theory Comput. Syst.
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2007 C conf
A Measure for the Degree of Nondeterminism of Context-Free Languages.
CIAA
Frantisek Mráz, Martin Plátek, Friedrich Otto
2007 J jnl
Ambiguity by Restarting Automata.
Int. J. Found. Comput. Sci.
Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski
2007 C conf
Free Word-Order and Restarting Automata.
LATA
Frantisek Mráz, Friedrich Otto, Martin Plátek
2007 C conf
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.
MCU
Frantisek Mráz, Friedrich Otto, Martin Plátek
2007 J jnl
Monotonicity of Restarting Automata.
J. Autom. Lang. Comb.
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
2006 C conf
Correctness Preservation and Complexity of Simple RL-Automata.
CIAA
Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 J jnl
Degrees of non-monotonicity for restarting automata.
Theor. Comput. Sci.
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 — conf
Learning Analysis by Reduction from Positive Data.
ICGI
Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 J jnl
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
Theor. Comput. Sci.
Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski
2006 C conf
On the Gap-Complexity of Simple RL-Automata.
Developments in Language Theory
Frantisek Mráz, Friedrich Otto, Martin Plátek
2005 J jnl
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Fundam. Informaticae
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2005 J jnl
Hierarchies of weakly monotone restarting automata.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto
2005 C conf
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Developments in Language Theory
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
2004 C conf
On Left-Monotone Deterministic Restarting Automata.
Developments in Language Theory
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2004 C conf
On the Complexity of 2-Monotone Restarting Automata.
Developments in Language Theory
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2003 — conf
Restarting Automata and Variants of j-Monotonicity.
DCFS
Martin Plátek, Friedrich Otto, Frantisek Mráz
2001 — conf
Degrees of (Non)Monotonicity of RRW-Automata.
DCFS
Martin Plátek, Frantisek Mráz
2001 J jnl
Lookahead Hierarchies of Restarting Automata.
J. Autom. Lang. Comb.
Frantisek Mráz
2001 — conf
On special forms of restarting automata.
Where Mathematics, Computer Science, Linguistics and Biology Meet
Frantisek Mráz, Martin Plátek, Martin Procházka
2000 — conf
Restarting Automata, Deleting and Marcus Grammars.
Recent Topics in Mathematical and Computational Linguistics
Frantisek Mráz, Martin Plátek, Martin Procházka
1999 J jnl
On Monotonic Automata with a Restart Operation.
J. Autom. Lang. Comb.
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1999 J jnl
On Special Forms of Restarting Automata.
Grammars
Frantisek Mráz, Martin Plátek, Martin Procházka
1998 J jnl
Calculating the exact bounds of optimal valuesin LP with interval coefficients.
Ann. Oper. Res.
Frantisek Mráz
1998 — conf
Different Types of Monotonicity for Restarting Automata.
FSTTCS
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1998 J jnl
Pascal Subroutines for Solving Some problems in Interval LP.
J. Univers. Comput. Sci.
Frantisek Mráz, Martin Kursch, Daniel Panuska
1997 C conf
Deleting Automata with a Restart Operation and Marcus Grammars.
Developments in Language Theory
Frantisek Mráz, Martin Plátek, Martin Procházka
1997 C conf
Deleting Automata with a Restart Operation.
Developments in Language Theory
Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
1997 B conf
Monotonic Rewriting Automata with a Restart Operation.
SOFSEM
Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel
1997 — conf
On Restarting Automata with Rewriting.
New Trends in Formal Languages
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1996 J jnl
Forgetting Automata and Context-Free Languages.
Acta Informatica
Petr Jancar, Frantisek Mráz, Martin Plátek
1996 B conf
Restarting Automata with Rewriting.
SOFSEM
Frantisek Mráz, Martin Plátek, Jörg Vogel
1995 C conf
Restarting Automata, Marcus Grammars and Context-Free Languages.
Developments in Language Theory
Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
1995 B conf
Restarting Automata.
FCT
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1993 B conf
A Taxonomy of Forgetting Automata.
MFCS
Petr Jancar, Frantisek Mráz, Martin Plátek
1992 B conf
Characterization of Context-Free Languages by Erasing Automata.
MFCS
Petr Jancar, Frantisek Mráz, Martin Plátek
1990 J jnl
Local minimizer of a nonconvex quadratic programming problem.
Computing
Frantisek Mráz