Martin Plátek

According to our database1, Martin Plátek
  • authored at least 74 papers between 1978 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On h-Lexicalized Restarting Automata.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Analysis by reduction of analytical PDT-trees.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

2016
Redukční analýza A-stromů s minimalistickými omezeními.
Proceedings of the 16th ITAT Conference Information Technologies, 2016

2015
Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus.
Proceedings of the Proceedings ITAT 2015: Information Technologies, 2015

2014
Free Word-Order and Restarting Automata.
Fundam. Inform., 2014

On the complexity of reductions by restarting automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Analysis by Reduction of D-trees.
Proceedings of the main track of the 14th Conference on Information Technologies - Applications and Theory (ITAT 2014), with selected papers from Znalosti 2014 collocated with Znalosti 2014, Demanovska Dolina - Jasna, Slovakia, September 25, 2014

On Minimalism of Analysis by Reduction by Restarting Automata.
Proceedings of the Formal Grammar - 19th International Conference, 2014

2013
Formalization of Word-Order Shifts by Restarting Automata.
Proceedings of the Conference on Information Technologies, 2013

2012
Taxonomy of Red-Automata Motivated by Error Localization.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Localization of (in)consistencies by monotone reducing automata.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2012

On Formalization of Word Order Properties.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

2011
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
Theor. Comput. Sci., 2011

Translations by Regulated Parallel Communicating Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2011

2010
(In)Dependencies in Functional Generative Description by Restarting Automata.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

Restarting Automata with Structured Output and Functional Generative Description.
Proceedings of the Language and Automata Theory and Applications, 2010

Towards a formal model of natural language description based on restarting automata with parallel DR-structures.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2010

On Lexicalized Well-Behaved Restarting Automata That Are Monotone.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages.
Theor. Comput. Sci., 2009

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.
Inf. Comput., 2009

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Parallel Communicating Grammar Systems with Regular Control.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
On the Complexity of 2-Monotone Restarting Automata.
Theory Comput. Syst., 2008

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
Towards a Formal Model for Functional Generative Description: Analysis by Reduction and Restarting Automata.
Prague Bull. Math. Linguistics, 2007

Monotonicity of Restarting Automata.
Journal of Automata, Languages and Combinatorics, 2007

Ambiguity by Restarting Automata.
Int. J. Found. Comput. Sci., 2007

A Measure for the Degree of Nondeterminism of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2007

Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Free Word-Order and Restarting Automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

A Linguistically-Based Segmentation of Complex Sentences.
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

2006
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Degrees of non-monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Correctness Preservation and Complexity of Simple RL-Automata.
Proceedings of the Implementation and Application of Automata, 2006

Segmentation of Complex Sentences.
Proceedings of the Text, Speech and Dialogue, 9th International Conference, 2006

Learning Analysis by Reduction from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

On the Gap-Complexity of Simple RL-Automata.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Fundam. Inform., 2005

Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction.
Proceedings of the Text, Speech and Dialogue, 8th International Conference, 2005

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
On Left-Monotone Deterministic Restarting Automata.
Proceedings of the Developments in Language Theory, 2004

On the Complexity of 2-Monotone Restarting Automata.
Proceedings of the Developments in Language Theory, 2004

2003
A Theoretical Basis of an Architecture of a Shell of a Reasonably Robust Syntactic Analyser.
Proceedings of the Text, Speech and Dialogue, 6th International Conference, 2003

Restarting Automata and Variants of j-Monotonicity.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

Proper Dependency Grammars.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2001
A Method of Accurate Robust Parsing of Czech.
Proceedings of the Text, Speech and Dialogue, 4th International Conference, 2001

Two-Way Restarting Automata and J-Monotonicity.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Word-Order Relaxations & Restrictions within a Dependency Grammar.
Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001), 2001

Degrees of (Non)Monotonicity of RRW-Automata.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

On special forms of restarting automata.
Proceedings of the Where Mathematics, 2001

2000
Restarting Automata, Deleting and Marcus Grammars.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Strict Monotonicity and Restarting Automata.
Prague Bull. Math. Linguistics, 1999

On Monotonic Automata with a Restart Operation.
Journal of Automata, Languages and Combinatorics, 1999

On Special Forms of Restarting Automata.
Grammars, 1999

Weak cyclic forms of rw-automata.
Proceedings of the Developments in Language Theory, 1999

1998
Different Types of Monotonicity for Restarting Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
Construction of a robust parser from a deterministic reduced parser.
Kybernetika, 1997

Monotonic Rewriting Automata with a Restart Operation.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Deleting Automata with a Restart Operation and Marcus Grammars.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Deleting Automata with a Restart Operation.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.
Proceedings of the New Trends in Formal Languages, 1997

A Prototype of a Grammar Checker for Czech.
Proceedings of the 5th Applied Natural Language Processing Conference, 1997

1996
Forgetting Automata and Context-Free Languages.
Acta Inf., 1996

Restarting Automata with Rewriting.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995
Parsing of Free-Word-Order Languages.
Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995

Restarting Automata.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Restarting Automata, Marcus Grammars and Context-Free Languages.
Proceedings of the Developments in Language Theory II, 1995

1994
A Grammar Based Approach To A Grammar Checking Of Free Word Order Languages.
Proceedings of the 15th International Conference on Computational Linguistics, 1994

1993
A Taxonomy of Forgetting Automata.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Characterization of Context-Free Languages by Erasing Automata.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1988
List automata with syntactically structured output.
Proceedings of the 12th International Conference on Computational Linguistics, 1988

1985
A note on the Chomsky hierarchy.
Bulletin of the EATCS, 1985

1982
Composition of Translation Schemes with D-Trees.
Proceedings of the 9th International Conference on Computational Linguistics, 1982

1978
A Scale of Context Sensitive Languages: Applications to Natural Language
Information and Control, July, 1978


  Loading...