default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrantisek Mráz
Person information
- affiliation: Charles University, Department of Computer Science, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka:
Non-Regularity of Complete CF(¢, $)-Grammars. ITAT 2024: 75-80- [c58]Frantisek Mráz, Friedrich Otto:
Repetitive Finite Automata With Translucent Letters. NCMA 2024: 150-167 - [e6]Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Martin Macaj, Frantisek Mráz, Richard Ostertág, Dana Pardubská, Martin Plátek, Martin Stanek:
Proceedings of the 24th Conference Information Technologies - Applications and Theory (ITAT 2024), Drienica, Slovakia, September 20-24, 2024. CEUR Workshop Proceedings 3792, CEUR-WS.org 2024 [contents] - 2023
- [j38]Frantisek Mráz, Friedrich Otto:
Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO Theor. Informatics Appl. 57: 8 (2023) - [c57]Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa:
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT 2023: 110-120 - [e5]Brona Brejová, Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Matej Lexa, Frantisek Mráz, Dana Pardubská, Martin Plátek:
Proceedings of the 23rd Conference Information Technologies - Applications and Theory (ITAT 2023), Tatranské Matliare, Slovakia, September 22-26, 2023. CEUR Workshop Proceedings 3498, CEUR-WS.org 2023 [contents] - 2022
- [j37]Martin Plátek
, Friedrich Otto, Frantisek Mráz:
One-Way Restarting Automata and Their Sensitivitys. Int. J. Found. Comput. Sci. 33(3&4): 371-387 (2022) - [j36]Frantisek Mráz, Friedrich Otto:
Recognizing Picture Languages by Reductions to String Languages. J. Autom. Lang. Comb. 27(1-3): 199-228 (2022) - [c56]David Kubon, Frantisek Mráz, Ivan Rychtera:
Learning Automata Using Dimensional Reduction. IBERAMIA 2022: 41-52 - [c55]Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa:
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT 2022: 111-121 - [c54]Frantisek Mráz, Friedrich Otto:
Non-Returning Finite Automata With Translucent Letters. NCMA 2022: 143-159 - [e4]Lucie Ciencialová, Martin Holena, Robert Jajcay, Tatiana Jajcayová, Frantisek Mráz, Dana Pardubská, Martin Plátek:
Proceedings of the 22nd Conference Information Technologies - Applications and Theory (ITAT 2022), Zuberec, Slovakia, September 23-27, 2022. CEUR Workshop Proceedings 3226, CEUR-WS.org 2022 [contents] - 2021
- [j35]Jorma Hirvensalo, Frantisek Mráz, Daniel Prusa:
Preface. Fundam. Informaticae 180(1-2) (2021) - [j34]Frantisek Mráz, Friedrich Otto:
On restarting automata with auxiliary symbols and small window size. RAIRO Theor. Informatics Appl. 55: 1-31 (2021) - [j33]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): 145-171 (2021) - [j32]Frantisek Mráz, Daniel Prusa, Michael Wehar:
Two-dimensional pattern matching against local and regular-like picture languages. Theor. Comput. Sci. 870: 137-152 (2021) - [c53]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: 140-146 - [e3]Brona Brejová, Lucie Ciencialová, Martin Holena, Frantisek Mráz, Dana Pardubská, Martin Plátek, Tomás Vinar:
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. CEUR Workshop Proceedings 2962, CEUR-WS.org 2021 [contents] - 2020
- [j31]Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Restarting List Automata. J. Autom. Lang. Comb. 25(2-3): 201-234 (2020) - [c52]David Kubon, Frantisek Mráz:
Learning Picture Languages Represented as Strings. FLAIRS 2020: 529-532 - [c51]Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma:
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT 2020: 51-58 - [e2]Martin Holena, Tomás Horváth, Alica Kelemenová, Frantisek Mráz, Dana Pardubská, Martin Plátek, Petr Sosík:
Proceedings of the 20th Conference Information Technologies - Applications and Theory (ITAT 2020), Hotel Tyrapol, Oravská Lesná, Slovakia, September 18-22, 2020. CEUR Workshop Proceedings 2718, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [j30]David Kubon, Frantisek Mráz:
How to Learn Picture Languages. Res. Comput. Sci. 148(11): 115-126 (2019) - [c50]Frantisek Mráz, Friedrich Otto:
On Shrinking Restarting Automata of Window Size One and Two. DLT 2019: 140-153 - [c49]Martin Plátek, Frantisek Mráz, Dana Pardubská:
Lexically Syntactic Characterization by Restarting Automata. ITAT 2019: 104-111 - [c48]Frantisek Mráz, Friedrich Otto:
Window size two suffices for deterministic monotone RWW-automata. NCMA 2019: 139-154 - [c47]Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek:
Lexicalized Syntactic Analysis by Restarting Automata. Stringology 2019: 69-83 - [c46]Frantisek Mráz, Daniel Prusa, Michael Wehar:
Two-Dimensional Pattern Matching Against Basic Picture Languages. CIAA 2019: 209-221 - 2018
- [j29]Friedrich Otto, Frantisek Mráz:
Automata with cyclic move operations for picture languages. RAIRO Theor. Informatics Appl. 52(2-3-4): 235-251 (2018) - [j28]Frantisek Mráz, Friedrich Otto:
On Deleting Deterministic Restarting Automata That Have Two Windows. J. Autom. Lang. Comb. 23(4): 387-417 (2018) - [c45]Martin Plátek, Dana Pardubská, Frantisek Mráz:
Robustness versus Sensibility by Two-Way Restarting Automata. ITAT 2018: 10-17 - [c44]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Characterizations of LRR-languages by correctness-preserving computations. NCMA 2018: 149-164 - 2017
- [j27]Friedrich Otto, Frantisek Mráz:
Regulated variants of limited context restarting automata. Theor. Comput. Sci. 682: 190-207 (2017) - [c43]Frantisek Mráz, Friedrich Otto:
Deleting Deterministic Restarting Automata with Two Windows. DLT 2017: 272-283 - [c42]Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Automata and h-Syntactic Analysis. ITAT 2017: 40-47 - [e1]Rudolf Freund, Frantisek Mráz, Daniel Prusa:
Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017. Österreichische Computer Gesellschaft 2017, ISBN 978-3-903035-18-8 [contents] - 2016
- [j26]Lukás Krtek, Frantisek Mráz:
Two-Dimensional Limited Context Restarting Automata. Fundam. Informaticae 148(3-4): 309-340 (2016) - [j25]Frantisek Mráz, Friedrich Otto, Daniel Prusa:
Some classes of rational functions for pictures. RAIRO Theor. Informatics Appl. 50(4): 351-369 (2016) - [c41]Friedrich Otto, Frantisek Mráz:
Cyclically extended variants of Sgraffito and restarting automata for picture languages. NCMA 2016: 259-273 - 2015
- [j24]Friedrich Otto, Frantisek Mráz:
Deterministic ordered restarting automata for picture languages. Acta Informatica 52(7-8): 593-623 (2015) - [j23]Friedrich Otto, Frantisek Mráz:
Lambda-confluence for context rewriting systems. Theor. Comput. Sci. 578: 88-99 (2015) - [c40]Frantisek Mráz, Friedrich Otto, Daniel Prusa:
On a class of rational functions for pictures. NCMA 2015: 159-176 - 2014
- [j22]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata. Fundam. Informaticae 133(4): 399-419 (2014) - [j21]Friedrich Otto, Peter Cerno, Frantisek Mráz:
On the classes of languages accepted by limited context restarting automata. RAIRO Theor. Informatics Appl. 48(1): 61-84 (2014) - [j20]Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Two-dimensional Sgraffito automata. RAIRO Theor. Informatics Appl. 48(5): 505-539 (2014) - [c39]Friedrich Otto, Frantisek Mráz:
Extended Two-Way Ordered Restarting Automata for Picture Languages. LATA 2014: 541-552 - [c38]Frantisek Mráz:
Limited restarting automata. NCMA 2014: 29-56 - [c37]Lukás Krtek, Frantisek Mráz:
Two-dimensional limited context restarting automata. NCMA 2014: 147-162 - [c36]Frantisek Mráz, Friedrich Otto:
Ordered Restarting Automata for Picture Languages. SOFSEM 2014: 431-442 - 2013
- [j19]Daniel Prusa, Frantisek Mráz:
Restarting Tiling Automata. Int. J. Found. Comput. Sci. 24(6): 863-878 (2013) - [c35]Daniel Prusa, Frantisek Mráz, Friedrich Otto:
New Results on Deterministic Sgraffito Automata. Developments in Language Theory 2013: 409-419 - [c34]Frantisek Mráz, Friedrich Otto:
Lambda-Confluence Is Undecidable for Clearing Restarting Automata. CIAA 2013: 256-267 - [c33]Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. CIAA 2013: 268-279 - 2012
- [c32]Daniel Prusa, Frantisek Mráz:
Two-Dimensional Sgraffito Automata. Developments in Language Theory 2012: 251-262 - [c31]Friedrich Otto, Peter Cerno, Frantisek Mráz:
Limited Context Restarting Automata and McNaughton Families of Languages. NCMA 2012: 165-180 - [c30]Daniel Prusa, Frantisek Mráz:
Restarting Tiling Automata. CIAA 2012: 289-300 - 2011
- [j18]Dana Pardubská, Frantisek Mráz, Martin Plátek:
Translations by Regulated Parallel Communicating Grammar Systems. J. Autom. Lang. Comb. 16(2-4): 215-251 (2011) - [c29]Peter Cerno, Frantisek Mráz:
Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}. Developments in Language Theory 2011: 153-164 - 2010
- [j17]Peter Cerno, Frantisek Mráz:
Clearing Restarting Automata. Fundam. Informaticae 104(1-2): 17-54 (2010) - [c28]Friedrich Otto, Martin Plátek, Frantisek Mráz:
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. Developments in Language Theory 2010: 352-363 - [c27]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: 25-32 - [c26]Martin Plátek, Frantisek Mráz, Markéta Lopatková:
Restarting Automata with Structured Output and Functional Generative Description. LATA 2010: 500-511 - [c25]Martin Plátek, Frantisek Mráz, Markéta Lopatková:
(In)Dependencies in Functional Generative Description by Restarting Automata. NCMA 2010: 155-170
2000 – 2009
- 2009
- [j16]Martin Plátek, Friedrich Otto, Frantisek Mráz:
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. Inf. Comput. 207(11): 1300-1314 (2009) - [j15]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): 3530-3538 (2009) - [c24]Peter Cerno, Frantisek Mráz:
Clearing Restarting Automata. NCMA 2009: 77-90 - 2008
- [j14]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On the Complexity of 2-Monotone Restarting Automata. Theory Comput. Syst. 42(4): 488-518 (2008) - 2007
- [j13]Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski:
Ambiguity by Restarting Automata. Int. J. Found. Comput. Sci. 18(6): 1343-1352 (2007) - [j12]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Monotonicity of Restarting Automata. J. Autom. Lang. Comb. 12(3): 355-371 (2007) - [c23]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata. LATA 2007: 425-436 - [c22]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. MCU 2007: 230-241 - [c21]Frantisek Mráz, Martin Plátek, Friedrich Otto:
A Measure for the Degree of Nondeterminism of Context-Free Languages. CIAA 2007: 192-202 - 2006
- [j11]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): 272-296 (2006) - [j10]Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Degrees of non-monotonicity for restarting automata. Theor. Comput. Sci. 369(1-3): 1-34 (2006) - [c20]Frantisek Mráz, Friedrich Otto, Martin Plátek:
On the Gap-Complexity of Simple RL-Automata. Developments in Language Theory 2006: 83-94 - [c19]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Learning Analysis by Reduction from Positive Data. ICGI 2006: 125-136 - [c18]Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Correctness Preservation and Complexity of Simple RL-Automata. CIAA 2006: 162-172 - 2005
- [j9]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Informaticae 64(1-4): 217-228 (2005) - [j8]Frantisek Mráz, Friedrich Otto:
Hierarchies of weakly monotone restarting automata. RAIRO Theor. Informatics Appl. 39(2): 325-342 (2005) - [c17]Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. Developments in Language Theory 2005: 284-295 - 2004
- [c16]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On the Complexity of 2-Monotone Restarting Automata. Developments in Language Theory 2004: 237-248 - [c15]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory 2004: 249-260 - 2003
- [c14]Martin Plátek, Friedrich Otto, Frantisek Mráz:
Restarting Automata and Variants of j-Monotonicity. DCFS 2003: 303-312 - 2001
- [j7]Frantisek Mráz:
Lookahead Hierarchies of Restarting Automata. J. Autom. Lang. Comb. 6(4): 493-506 (2001) - [c13]Frantisek Mráz, Martin Plátek, Martin Procházka:
On special forms of restarting automata. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 149-160 - [c12]Martin Plátek, Frantisek Mráz:
Degrees of (Non)Monotonicity of RRW-Automata. DCFS 2001: 159-165 - 2000
- [c11]Frantisek Mráz, Martin Plátek, Martin Procházka:
Restarting Automata, Deleting and Marcus Grammars. Recent Topics in Mathematical and Computational Linguistics 2000: 218-233
1990 – 1999
- 1999
- [j6]Frantisek Mráz, Martin Plátek, Martin Procházka:
On Special Forms of Restarting Automata. Grammars 2(3): 223-233 (1999) - [j5]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4(4): 287-311 (1999) - 1998
- [j4]Frantisek Mráz:
Calculating the exact bounds of optimal valuesin LP with interval coefficients. Ann. Oper. Res. 81: 51-62 (1998) - [j3]Frantisek Mráz, Martin Kursch, Daniel Panuska:
Pascal Subroutines for Solving Some problems in Interval LP. J. Univers. Comput. Sci. 4(2): 164-170 (1998) - [c10]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Different Types of Monotonicity for Restarting Automata. FSTTCS 1998: 343-354 - 1997
- [c9]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Restarting Automata with Rewriting. New Trends in Formal Languages 1997: 119-136 - [c8]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: 191-202 - [c7]Frantisek Mráz, Martin Plátek, Martin Procházka:
Deleting Automata with a Restart Operation and Marcus Grammars. Developments in Language Theory 1997: 329-342 - [c6]Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel:
Monotonic Rewriting Automata with a Restart Operation. SOFSEM 1997: 505-512 - 1996
- [j2]Petr Jancar, Frantisek Mráz, Martin Plátek:
Forgetting Automata and Context-Free Languages. Acta Informatica 33(5): 409-420 (1996) - [c5]Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata with Rewriting. SOFSEM 1996: 401-408 - 1995
- [c4]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: 102-111 - [c3]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata. FCT 1995: 283-292 - 1993
- [c2]Petr Jancar, Frantisek Mráz, Martin Plátek:
A Taxonomy of Forgetting Automata. MFCS 1993: 527-536 - 1992
- [c1]Petr Jancar, Frantisek Mráz, Martin Plátek:
Characterization of Context-Free Languages by Erasing Automata. MFCS 1992: 307-314 - 1990
- [j1]Frantisek Mráz:
Local minimizer of a nonconvex quadratic programming problem. Computing 45(3): 283-289 (1990)
Coauthor Index
[c59] [e6] [c57] [e5] [j37] [c55] [e4] [j33] [c53] [e3] [j31] [c51] [e2] [c49] [c47] [c45] [c44] [c42] [j22] [j18] [c28] [c27] [c26] [c25] [j16] [j15] [j14] [j13] [j12] [c23] [c22] [c21] [j11] [j10] [c20] [c19] [c18] [j9] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [j6] [j5] [c10] [c9] [c8] [c7] [c6] [j2] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
