Martin Plátek

97 papers B 11C 16Misc 2Journal 22Unranked 41
YearRankTypeTitle / Venue / Authors
2024 — conf
Non-Regularity of Complete CF(¢, $)-Grammars.
ITAT
Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka
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
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
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
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 — 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
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 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 — conf
One Analog Neuron Cannot Recognize Deterministic Context-Free Languages.
ICONIP (3)
Jirí Síma, Martin Plátek
2018 — conf
Characterizations of LRR-languages by correctness-preserving computations.
NCMA
Frantisek Mráz, Friedrich Otto, Martin Plátek
2018 — conf
Robustness versus Sensibility by Two-Way Restarting Automata.
ITAT
Martin Plátek, Dana Pardubská, Frantisek Mráz
2017 — conf
Analysis by reduction of analytical PDT-trees.
NCMA
Martin Plátek, Karel Oliva, Dana Pardubská
2017 — conf
On h-Lexicalized Automata and h-Syntactic Analysis.
ITAT
Martin Plátek, Friedrich Otto, Frantisek Mráz
2017 — conf
On h-Lexicalized Restarting Automata.
AFL
Martin Plátek, Friedrich Otto
2016 — conf
Redukční analýza A-stromů s minimalistickými omezeními.
ITAT
Martin Plátek, Karel Oliva
2015 — conf
Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus.
ITAT
Martin Plátek, Dana Pardubská, Karel Oliva
2014 — conf
Analysis by Reduction of D-trees.
ITAT
Martin Plátek
2014 J jnl
Free Word-Order and Restarting Automata.
Fundam. Informaticae
Frantisek Mráz, Friedrich Otto, Martin Plátek
2014 B conf
On Minimalism of Analysis by Reduction by Restarting Automata.
FG
Martin Plátek, Dana Pardubská, Markéta Lopatková
2014 — conf
On the complexity of reductions by restarting automata.
NCMA
Martin Plátek, Markéta Lopatková, Dana Pardubská
2013 — conf
Formalization of Word-Order Shifts by Restarting Automata.
ITAT
Markéta Lopatková, Martin Plátek
2012 — conf
Localization of (in)consistencies by monotone reducing automata.
ITAT
Martin Procházka, Martin Plátek
2012 — conf
On Formalization of Word Order Properties.
CICLing (1)
Vladislav Kubon, Markéta Lopatková, Martin Plátek
2012 — conf
Taxonomy of Red-Automata Motivated by Error Localization.
NCMA
Martin Procházka, Martin Plátek
2011 J jnl
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
Theor. Comput. Sci.
Dana Pardubská, Martin Plátek, Friedrich Otto
2011 J jnl
Translations by Regulated Parallel Communicating Grammar Systems.
J. Autom. Lang. Comb.
Dana Pardubská, Frantisek Mráz, Martin Plátek
2010 — conf
(In)Dependencies in Functional Generative Description by Restarting Automata.
NCMA
Martin Plátek, Frantisek Mráz, Markéta Lopatková
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 C conf
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
LATA
Dana Pardubská, Martin Plátek, Friedrich Otto
2009 — conf
Parallel Communicating Grammar Systems with Regular Control.
CAI
Dana Pardubská, Martin Plátek, Friedrich Otto
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 C conf
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata.
LATA
Friedrich Otto, Martin Plátek
2008 — conf
On PCGS and FRR-automata.
ITAT
Dana Pardubská, Martin Plátek, Friedrich Otto
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 Misc conf
A Linguistically-Based Segmentation of Complex Sentences.
FLAIRS
Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan
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
2007 J jnl
Towards a Formal Model for Functional Generative Description: Analysis by Reduction and Restarting Automata.
Prague Bull. Math. Linguistics
Markéta Lopatková, Martin Plátek, Petr Sgall
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
2006 — conf
Segmentation of Complex Sentences.
TSD
Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan
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 — conf
Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction.
TSD
Markéta Lopatková, Martin Plátek, Vladislav Kubon
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
A Theoretical Basis of an Architecture of a Shell of a Reasonably Robust Syntactic Analyser.
TSD
Tomás Holan, Vladislav Kubon, Martin Plátek, Karel Oliva
2003 — conf
Proper Dependency Grammars.
DCFS
Radu Gramatovici, Martin Plátek
2003 — conf
Restarting Automata and Variants of j-Monotonicity.
DCFS
Martin Plátek, Friedrich Otto, Frantisek Mráz
2001 — conf
A Method of Accurate Robust Parsing of Czech.
TSD
Vladislav Kubon, Martin Plátek
2001 — conf
Degrees of (Non)Monotonicity of RRW-Automata.
DCFS
Martin Plátek, Frantisek Mráz
2001 — conf
On Relax-ability of Word-Order by D-grammars.
DMTCS
Martin Plátek, Tomás Holan, Vladislav Kubon
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
2001 B conf
Two-Way Restarting Automata and J-Monotonicity.
SOFSEM
Martin Plátek
2001 — conf
Word-Order Relaxations & Restrictions within a Dependency Grammar.
IWPT
Martin Plátek, Tomás Holan, Vladislav Kubon, Karel Oliva
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
1999 J jnl
Strict Monotonicity and Restarting Automata.
Prague Bull. Math. Linguistics
Martin Plátek
1999 C conf
Weak cyclic forms of rw-automata.
Developments in Language Theory
Martin Plátek
1998 — conf
Different Types of Monotonicity for Restarting Automata.
FSTTCS
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1997 — conf
A Prototype of a Grammar Checker for Czech.
ANLP
Tomás Holan, Vladislav Kubon, Martin Plátek
1997 J jnl
Construction of a robust parser from a deterministic reduced parser.
Kybernetika
Martin Plátek
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 — conf
Formal Tools for Separating Syntactically Correct and Incorrect Structures.
IWPT
Martin Plátek, Vladislav Kubon, Tomás Holan
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 — conf
An Implementation of Syntactic Analysis of Czech.
IWPT
Tomás Holan, Vladislav Kubon, Martin Plátek
1995 B conf
Parsing of Free-Word-Order Languages.
SOFSEM
Tomás Holan, Vladislav Kubon, Martin Plátek
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
1994 B conf
A Grammar Based Approach To A Grammar Checking Of Free Word Order Languages.
COLING
Vladislav Kubon, Martin Plátek
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
1988 B conf
List automata with syntactically structured output.
COLING
Karel Oliva, Martin Plátek
1985 J jnl
A note on the Chomsky hierarchy.
Bull. EATCS
Michal P. Chytil, Martin Plátek, Jörg Vogel
1982 B conf
Composition of Translation Schemes with D-Trees.
COLING
Martin Plátek
1978 J jnl
A Scale of Context Sensitive Languages: Applications to Natural Language
Inf. Control.
Martin Plátek, Petr Sgall