default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Plátek
Person information
SPARQL queries 
🛈 Please note that only 51% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c70]Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka:
Non-Regularity of Complete CF(¢, $)-Grammars. ITAT 2024: 75-80- [e5]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
- [c69]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 - [e4]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
- [j22]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) - [c68]Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa:
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT 2022: 111-121 - [e3]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
- [j21]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) - [c67]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 - [e2]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
- [j20]Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Restarting List Automata. J. Autom. Lang. Comb. 25(2-3): 201-234 (2020) - [c66]Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma:
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT 2020: 51-58 - [e1]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
- [c65]Jirí Síma, Martin Plátek:
One Analog Neuron Cannot Recognize Deterministic Context-Free Languages. ICONIP (3) 2019: 77-89 - [c64]Martin Plátek, Frantisek Mráz, Dana Pardubská:
Lexically Syntactic Characterization by Restarting Automata. ITAT 2019: 104-111 - [c63]Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek:
Lexicalized Syntactic Analysis by Restarting Automata. Stringology 2019: 69-83 - 2018
- [c62]Martin Plátek, Dana Pardubská, Frantisek Mráz:
Robustness versus Sensibility by Two-Way Restarting Automata. ITAT 2018: 10-17 - [c61]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Characterizations of LRR-languages by correctness-preserving computations. NCMA 2018: 149-164 - 2017
- [c60]Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Automata and h-Syntactic Analysis. ITAT 2017: 40-47 - [c59]Martin Plátek, Karel Oliva, Dana Pardubská:
Analysis by reduction of analytical PDT-trees. NCMA 2017: 211-226 - [c58]Martin Plátek, Friedrich Otto:
On h-Lexicalized Restarting Automata. AFL 2017: 219-233 - 2016
- [c57]Martin Plátek, Karel Oliva:
Redukční analýza A-stromů s minimalistickými omezeními. ITAT 2016: 26-33 - 2015
- [c56]Martin Plátek, Dana Pardubská, Karel Oliva:
Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus. ITAT 2015: 43-50 - 2014
- [j19]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata. Fundam. Informaticae 133(4): 399-419 (2014) - [c55]Martin Plátek, Dana Pardubská, Markéta Lopatková:
On Minimalism of Analysis by Reduction by Restarting Automata. FG 2014: 155-170 - [c54]Martin Plátek:
Analysis by Reduction of D-trees. ITAT 2014: 68-71 - [c53]Martin Plátek, Markéta Lopatková, Dana Pardubská:
On the complexity of reductions by restarting automata. NCMA 2014: 207-222 - 2013
- [c52]Markéta Lopatková, Martin Plátek:
Formalization of Word-Order Shifts by Restarting Automata. ITAT 2013: 2-9 - 2012
- [c51]Vladislav Kubon, Markéta Lopatková, Martin Plátek:
On Formalization of Word Order Properties. CICLing (1) 2012: 130-141 - [c50]Martin Procházka, Martin Plátek:
Localization of (in)consistencies by monotone reducing automata. ITAT 2012: 55-62 - [c49]Martin Procházka, Martin Plátek:
Taxonomy of Red-Automata Motivated by Error Localization. NCMA 2012: 181-195 - 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) - [j17]Dana Pardubská, Martin Plátek, Friedrich Otto:
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theor. Comput. Sci. 412(4-5): 458-477 (2011) - 2010
- [c48]Friedrich Otto, Martin Plátek, Frantisek Mráz:
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. Developments in Language Theory 2010: 352-363 - [c47]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 - [c46]Martin Plátek, Frantisek Mráz, Markéta Lopatková:
Restarting Automata with Structured Output and Functional Generative Description. LATA 2010: 500-511 - [c45]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) - [c44]Dana Pardubská, Martin Plátek, Friedrich Otto:
Parallel Communicating Grammar Systems with Regular Control. CAI 2009: 342-360 - [c43]Dana Pardubská, Martin Plátek, Friedrich Otto:
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA 2009: 660-671 - 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) - [c42]Dana Pardubská, Martin Plátek, Friedrich Otto:
On PCGS and FRR-automata. ITAT 2008 - [c41]Friedrich Otto, Martin Plátek:
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. LATA 2008: 409-420 - 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) - [j11]Markéta Lopatková, Martin Plátek, Petr Sgall:
Towards a Formal Model for Functional Generative Description: Analysis by Reduction and Restarting Automata. Prague Bull. Math. Linguistics 87: 7-26 (2007) - [c40]Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan:
A Linguistically-Based Segmentation of Complex Sentences. FLAIRS 2007: 368-373 - [c39]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata. LATA 2007: 425-436 - [c38]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. MCU 2007: 230-241 - [c37]Frantisek Mráz, Martin Plátek, Friedrich Otto:
A Measure for the Degree of Nondeterminism of Context-Free Languages. CIAA 2007: 192-202 - 2006
- [j10]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) - [j9]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) - [c36]Frantisek Mráz, Friedrich Otto, Martin Plátek:
On the Gap-Complexity of Simple RL-Automata. Developments in Language Theory 2006: 83-94 - [c35]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Learning Analysis by Reduction from Positive Data. ICGI 2006: 125-136 - [c34]Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan:
Segmentation of Complex Sentences. TSD 2006: 151-158 - [c33]Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Correctness Preservation and Complexity of Simple RL-Automata. CIAA 2006: 162-172 - 2005
- [j8]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) - [c32]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 - [c31]Markéta Lopatková, Martin Plátek, Vladislav Kubon:
Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction. TSD 2005: 140-147 - 2004
- [c30]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 - [c29]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory 2004: 249-260 - 2003
- [c28]Radu Gramatovici, Martin Plátek:
Proper Dependency Grammars. DCFS 2003: 255-264 - [c27]Martin Plátek, Friedrich Otto, Frantisek Mráz:
Restarting Automata and Variants of j-Monotonicity. DCFS 2003: 303-312 - [c26]Tomás Holan, Vladislav Kubon, Martin Plátek, Karel Oliva:
A Theoretical Basis of an Architecture of a Shell of a Reasonably Robust Syntactic Analyser. TSD 2003: 58-65 - 2001
- [c25]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 - [c24]Martin Plátek, Frantisek Mráz:
Degrees of (Non)Monotonicity of RRW-Automata. DCFS 2001: 159-165 - [c23]Martin Plátek, Tomás Holan, Vladislav Kubon:
On Relax-ability of Word-Order by D-grammars. DMTCS 2001: 159-173 - [c22]Martin Plátek, Tomás Holan, Vladislav Kubon, Karel Oliva:
Word-Order Relaxations & Restrictions within a Dependency Grammar. IWPT 2001 - [c21]Martin Plátek:
Two-Way Restarting Automata and J-Monotonicity. SOFSEM 2001: 316-325 - [c20]Vladislav Kubon, Martin Plátek:
A Method of Accurate Robust Parsing of Czech. TSD 2001: 92-99 - 2000
- [c19]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
- [j7]Frantisek Mráz, Martin Plátek, Martin Procházka:
On Special Forms of Restarting Automata. Grammars 2(3): 223-233 (1999) - [j6]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) - [j5]Martin Plátek:
Strict Monotonicity and Restarting Automata. Prague Bull. Math. Linguistics 72: 11-28 (1999) - [c18]Martin Plátek:
Weak cyclic forms of rw-automata. Developments in Language Theory 1999: 115-124 - 1998
- [c17]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Different Types of Monotonicity for Restarting Automata. FSTTCS 1998: 343-354 - 1997
- [j4]Martin Plátek:
Construction of a robust parser from a deterministic reduced parser. Kybernetika 33(3): 311-332 (1997) - [c16]Tomás Holan, Vladislav Kubon, Martin Plátek:
A Prototype of a Grammar Checker for Czech. ANLP 1997: 147-154 - [c15]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Restarting Automata with Rewriting. New Trends in Formal Languages 1997: 119-136 - [c14]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 - [c13]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 - [c12]Martin Plátek, Vladislav Kubon, Tomás Holan:
Formal Tools for Separating Syntactically Correct and Incorrect Structures. IWPT 1997: 247-248 - [c11]Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel:
Monotonic Rewriting Automata with a Restart Operation. SOFSEM 1997: 505-512 - 1996
- [j3]Petr Jancar, Frantisek Mráz, Martin Plátek:
Forgetting Automata and Context-Free Languages. Acta Informatica 33(5): 409-420 (1996) - [c10]Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata with Rewriting. SOFSEM 1996: 401-408 - 1995
- [c9]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 - [c8]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata. FCT 1995: 283-292 - [c7]Tomás Holan, Vladislav Kubon, Martin Plátek:
An Implementation of Syntactic Analysis of Czech. IWPT 1995: 126-135 - [c6]Tomás Holan, Vladislav Kubon, Martin Plátek:
Parsing of Free-Word-Order Languages. SOFSEM 1995: 379-384 - 1994
- [c5]Vladislav Kubon, Martin Plátek:
A Grammar Based Approach To A Grammar Checking Of Free Word Order Languages. COLING 1994: 906-910 - 1993
- [c4]Petr Jancar, Frantisek Mráz, Martin Plátek:
A Taxonomy of Forgetting Automata. MFCS 1993: 527-536 - 1992
- [c3]Petr Jancar, Frantisek Mráz, Martin Plátek:
Characterization of Context-Free Languages by Erasing Automata. MFCS 1992: 307-314
1980 – 1989
- 1988
- [c2]Karel Oliva, Martin Plátek:
List automata with syntactically structured output. COLING 1988: 498-500 - 1985
- [j2]Michal P. Chytil, Martin Plátek, Jörg Vogel:
A note on the Chomsky hierarchy. Bull. EATCS 27: 23-29 (1985) - 1982
- [c1]Martin Plátek:
Composition of Translation Schemes with D-Trees. COLING 1982: 313-318
1970 – 1979
- 1978
- [j1]Martin Plátek, Petr Sgall:
A Scale of Context Sensitive Languages: Applications to Natural Language. Inf. Control. 38(1): 1-20 (1978)
Coauthor Index
[c70] [e5] [c69] [e4] [j22] [c68] [e3] [j21] [c67] [e2] [j20] [c66] [e1] [c64] [c63] [c62] [c61] [c60] [j19] [j18] [c48] [c47] [c46] [c45] [j16] [j15] [j14] [j13] [j12] [c39] [c38] [c37] [j10] [j9] [c36] [c35] [c33] [j8] [c32] [c30] [c29] [c27] [c25] [c24] [c19] [j7] [j6] [c17] [c15] [c14] [c13] [c11] [j3] [c10] [c9] [c8] [c4] [c3]
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-10-25 20:15 CEST 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:
