Martin Plátek

Publication Activity (10 Years)

Years Active: 1978-2023
Publications (10 Years): 16

Top Topics

Finite State Automaton

Syntactic Analysis

Natural Language

Finite Automata

Top Venues

J. Autom. Lang. Comb.

Publications

Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT (2023)
Martin Plátek, Friedrich Otto, Frantisek Mráz
One-Way Restarting Automata and Their Sensitivitys. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT (2022)
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)
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) (2021)
Martin Plátek, Friedrich Otto, Frantisek Mráz
On h-Lexicalized Restarting List Automata. J. Autom. Lang. Comb. 25 (2-3) (2020)
Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT (2020)
Jirí Síma, Martin Plátek
One Analog Neuron Cannot Recognize Deterministic Context-Free Languages. ICONIP (3) (2019)
Martin Plátek, Frantisek Mráz, Dana Pardubská
Lexically Syntactic Characterization by Restarting Automata. ITAT (2019)
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
Lexicalized Syntactic Analysis by Restarting Automata. Stringology (2019)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Characterizations of LRR-languages by correctness-preserving computations. NCMA (2018)
Martin Plátek, Dana Pardubská, Frantisek Mráz
Robustness versus Sensibility by Two-Way Restarting Automata. ITAT (2018)
Martin Plátek, Karel Oliva, Dana Pardubská
Analysis by reduction of analytical PDT-trees. NCMA (2017)
Martin Plátek, Friedrich Otto, Frantisek Mráz
On h-Lexicalized Automata and h-Syntactic Analysis. ITAT (2017)
Martin Plátek, Friedrich Otto
On h-Lexicalized Restarting Automata. AFL (2017)
Martin Plátek, Karel Oliva
Redukční analýza A-stromů s minimalistickými omezeními. ITAT (2016)
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)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Free Word-Order and Restarting Automata. Fundam. Informaticae 133 (4) (2014)
Martin Plátek
Analysis by Reduction of D-trees. ITAT (2014)
Martin Plátek, Dana Pardubská, Markéta Lopatková
On Minimalism of Analysis by Reduction by Restarting Automata. FG (2014)
Martin Plátek, Markéta Lopatková, Dana Pardubská
On the complexity of reductions by restarting automata. NCMA (2014)
Markéta Lopatková, Martin Plátek
Formalization of Word-Order Shifts by Restarting Automata. ITAT (2013)
Martin Procházka, Martin Plátek
Taxonomy of Red-Automata Motivated by Error Localization. NCMA (2012)
Martin Procházka, Martin Plátek
Localization of (in)consistencies by monotone reducing automata. ITAT (2012)
Vladislav Kubon, Markéta Lopatková, Martin Plátek
On Formalization of Word Order Properties. CICLing (1) (2012)
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) (2011)
Dana Pardubská, Frantisek Mráz, Martin Plátek
Translations by Regulated Parallel Communicating Grammar Systems. J. Autom. Lang. Comb. 16 (2-4) (2011)
Martin Plátek, Frantisek Mráz, Markéta Lopatková
(In)Dependencies in Functional Generative Description by Restarting Automata. NCMA (2010)
Friedrich Otto, Martin Plátek, Frantisek Mráz
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. Developments in Language Theory (2010)
Martin Plátek, Frantisek Mráz, Markéta Lopatková
Restarting Automata with Structured Output and Functional Generative Description. LATA (2010)
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)
Dana Pardubská, Martin Plátek, Friedrich Otto
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA (2009)
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) (2009)
Martin Plátek, Friedrich Otto, Frantisek Mráz
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. Inf. Comput. 207 (11) (2009)
Dana Pardubská, Martin Plátek, Friedrich Otto
Parallel Communicating Grammar Systems with Regular Control. CAI (2009)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
On the Complexity of 2-Monotone Restarting Automata. Theory Comput. Syst. 42 (4) (2008)
Friedrich Otto, Martin Plátek
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. LATA (2008)
Dana Pardubská, Martin Plátek, Friedrich Otto
On PCGS and FRR-automata. ITAT (2008)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Free Word-Order and Restarting Automata. LATA (2007)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. MCU (2007)
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 (2007)
Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan
A Linguistically-Based Segmentation of Complex Sentences. FLAIRS Conference (2007)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
Monotonicity of Restarting Automata. J. Autom. Lang. Comb. 12 (3) (2007)
Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski
Ambiguity by Restarting Automata. Int. J. Found. Comput. Sci. 18 (6) (2007)
Frantisek Mráz, Martin Plátek, Friedrich Otto
A Measure for the Degree of Nondeterminism of Context-Free Languages. CIAA (2007)
Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan
Segmentation of Complex Sentences. TSD (2006)
Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek
Correctness Preservation and Complexity of Simple RL-Automata. CIAA (2006)
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
Degrees of non-monotonicity for restarting automata. Theor. Comput. Sci. 369 (1-3) (2006)
Frantisek Mráz, Friedrich Otto, Martin Plátek
On the Gap-Complexity of Simple RL-Automata. Developments in Language Theory (2006)
Frantisek Mráz, Friedrich Otto, Martin Plátek
Learning Analysis by Reduction from Positive Data. ICGI (2006)
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) (2006)
Markéta Lopatková, Martin Plátek, Vladislav Kubon
Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction. TSD (2005)
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. Developments in Language Theory (2005)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Informaticae 64 (1-4) (2005)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
On the Complexity of 2-Monotone Restarting Automata. Developments in Language Theory (2004)
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory (2004)
Radu Gramatovici, Martin Plátek
Proper Dependency Grammars. DCFS (2003)
Martin Plátek, Friedrich Otto, Frantisek Mráz
Restarting Automata and Variants of j-Monotonicity. DCFS (2003)
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)
Martin Plátek, Tomás Holan, Vladislav Kubon, Karel Oliva
Word-Order Relaxations & Restrictions within a Dependency Grammar. IWPT (2001)
Vladislav Kubon, Martin Plátek
A Method of Accurate Robust Parsing of Czech. TSD (2001)
Martin Plátek, Tomás Holan, Vladislav Kubon
On Relax-ability of Word-Order by D-grammars. DMTCS (2001)
Martin Plátek
Two-Way Restarting Automata and J-Monotonicity. SOFSEM (2001)
Martin Plátek, Frantisek Mráz
Degrees of (Non)Monotonicity of RRW-Automata. DCFS (2001)
Frantisek Mráz, Martin Plátek, Martin Procházka
On special forms of restarting automata. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Frantisek Mráz, Martin Plátek, Martin Procházka
Restarting Automata, Deleting and Marcus Grammars. Recent Topics in Mathematical and Computational Linguistics (2000)
Martin Plátek
Strict Monotonicity and Restarting Automata. Prague Bull. Math. Linguistics 72 (1999)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4 (4) (1999)
Martin Plátek
Weak cyclic forms of rw-automata. Developments in Language Theory (1999)
Frantisek Mráz, Martin Plátek, Martin Procházka
On Special Forms of Restarting Automata. Grammars 2 (3) (1999)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
Different Types of Monotonicity for Restarting Automata. FSTTCS (1998)
Martin Plátek, Vladislav Kubon, Tomás Holan
Formal Tools for Separating Syntactically Correct and Incorrect Structures. IWPT (1997)
Tomás Holan, Vladislav Kubon, Martin Plátek
A Prototype of a Grammar Checker for Czech. ANLP (1997)
Martin Plátek
Construction of a robust parser from a deterministic reduced parser. Kybernetika 33 (3) (1997)
Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel
Monotonic Rewriting Automata with a Restart Operation. SOFSEM (1997)
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)
Frantisek Mráz, Martin Plátek, Martin Procházka
Deleting Automata with a Restart Operation and Marcus Grammars. Developments in Language Theory (1997)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
On Restarting Automata with Rewriting. New Trends in Formal Languages (1997)
Petr Jancar, Frantisek Mráz, Martin Plátek
Forgetting Automata and Context-Free Languages. Acta Informatica 33 (5) (1996)
Frantisek Mráz, Martin Plátek, Jörg Vogel
Restarting Automata with Rewriting. SOFSEM (1996)
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)
Tomás Holan, Vladislav Kubon, Martin Plátek
Parsing of Free-Word-Order Languages. SOFSEM (1995)
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
Restarting Automata. FCT (1995)
Tomás Holan, Vladislav Kubon, Martin Plátek
An Implementation of Syntactic Analysis of Czech. IWPT (1995)
Vladislav Kubon, Martin Plátek
A Grammar Based Approach To A Grammar Checking Of Free Word Order Languages. COLING (1994)
Petr Jancar, Frantisek Mráz, Martin Plátek
A Taxonomy of Forgetting Automata. MFCS (1993)
Petr Jancar, Frantisek Mráz, Martin Plátek
Characterization of Context-Free Languages by Erasing Automata. MFCS (1992)
Karel Oliva, Martin Plátek
List automata with syntactically structured output. COLING (1988)
Michal P. Chytil, Martin Plátek, Jörg Vogel
A note on the Chomsky hierarchy. Bull. EATCS 27 (1985)
Martin Plátek
Composition of Translation Schemes with D-Trees. COLING (1982)
Martin Plátek, Petr Sgall
A Scale of Context Sensitive Languages: Applications to Natural Language Inf. Control. 38 (1) (1978)