Martin Plátek

Proceedings of the Formal Grammar - 19th International Conference, 2014

2013

Formalization of Word-Order Shifts by Restarting Automata.

[BibT_eX]

[DOI]

Proceedings of the Conference on Information Technologies, 2013

2012

Taxonomy of Red-Automata Motivated by Error Localization.

[BibT_eX]

Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Localization of (in)consistencies by monotone reducing automata.

[BibT_eX]

[DOI]

Proceedings of the Conference on Theory and Practice of Information Technologies, 2012

On Formalization of Word Order Properties.

[BibT_eX]

[DOI]

Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

2011

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Translations by Regulated Parallel Communicating Grammar Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

2010

(In)Dependencies in Functional Generative Description by Restarting Automata.

[BibT_eX]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Conference on Theory and Practice of Information Technologies, 2010

On Lexicalized Well-Behaved Restarting Automata That Are Monotone.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.

[BibT_eX]

[DOI]

Inf. Comput., 2009

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Parallel Communicating Grammar Systems with Regular Control.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

On the Complexity of 2-Monotone Restarting Automata.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

On PCGS and FRR-automata.

[BibT_eX]

[DOI]

Proceedings of the Conference on Theory and Practice of Information Technologies, 2008

2007

Towards a Formal Model for Functional Generative Description: Analysis by Reduction and Restarting Automata.

[BibT_eX]

[DOI]

Petr Sgall

Prague Bull. Math. Linguistics, 2007

Monotonicity of Restarting Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

Ambiguity by Restarting Automata.

[BibT_eX]

[DOI]

Tomasz Jurdzinski

Int. J. Found. Comput. Sci., 2007

A Measure for the Degree of Nondeterminism of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2007

Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

A Linguistically-Based Segmentation of Complex Sentences.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Degrees of non-monotonicity for restarting automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Correctness Preservation and Complexity of Simple RL-Automata.

[BibT_eX]

[DOI]

Hartmut Messerschmidt

Proceedings of the Implementation and Application of Automata, 2006

Segmentation of Complex Sentences.

[BibT_eX]

[DOI]

Proceedings of the Text, Speech and Dialogue, 9th International Conference, 2006

Learning Analysis by Reduction from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

On the Gap-Complexity of Simple RL-Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction.

[BibT_eX]

[DOI]

Proceedings of the Text, Speech and Dialogue, 8th International Conference, 2005

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

On Left-Monotone Deterministic Restarting Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

A Theoretical Basis of an Architecture of a Shell of a Reasonably Robust Syntactic Analyser.

[BibT_eX]

[DOI]

Proceedings of the Text, Speech and Dialogue, 6th International Conference, 2003

Restarting Automata and Variants of j-Monotonicity.

[BibT_eX]

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

Proper Dependency Grammars.

[BibT_eX]

Radu Gramatovici

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.

[BibT_eX]

[DOI]

Proceedings of the Text, Speech and Dialogue, 4th International Conference, 2001

Two-Way Restarting Automata and J-Monotonicity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001), 2001

On Relax-ability of Word-Order by D-grammars.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2001

Degrees of (Non)Monotonicity of RRW-Automata.

[BibT_eX]

Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

2000

Restarting Automata, Deleting and Marcus Grammars.

[BibT_eX]

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999

Strict Monotonicity and Restarting Automata.

[BibT_eX]

Prague Bull. Math. Linguistics, 1999

On Monotonic Automata with a Restart Operation.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

On Special Forms of Restarting Automata.

[BibT_eX]

[DOI]

Grammars, 1999

Weak cyclic forms of rw-automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

1998

Different Types of Monotonicity for Restarting Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Construction of a robust parser from a deterministic reduced parser.

[BibT_eX]

[DOI]

Kybernetika, 1997

Monotonic Rewriting Automata with a Restart Operation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Formal Tools for Separating Syntactically Correct and Incorrect Structures.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Parsing Technologies, 1997

Deleting Automata with a Restart Operation and Marcus Grammars.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Deleting Automata with a Restart Operation.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

A Prototype of a Grammar Checker for Czech.

[BibT_eX]

[DOI]

Proceedings of the 5th Applied Natural Language Processing Conference, 1997

1996

Forgetting Automata and Context-Free Languages.

[BibT_eX]

[DOI]

Petr Jancar

Acta Informatica, 1996

Restarting Automata with Rewriting.

[BibT_eX]

[DOI]

Jörg Vogel

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995

Parsing of Free-Word-Order Languages.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995

An Implementation of Syntactic Analysis of Czech.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Parsing Technologies, 1995

Restarting Automata.

[BibT_eX]

[DOI]

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

Restarting Automata, Marcus Grammars and Context-Free Languages.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

A Grammar Based Approach To A Grammar Checking Of Free Word Order Languages.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Computational Linguistics, 1994

1993

A Taxonomy of Forgetting Automata.

[BibT_eX]

[DOI]

Petr Jancar

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Characterization of Context-Free Languages by Erasing Automata.

[BibT_eX]

[DOI]

Petr Jancar

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1988

List automata with syntactically structured output.

[BibT_eX]

[DOI]

Karel Oliva

Proceedings of the 12th International Conference on Computational Linguistics, 1988

1985

A note on the Chomsky hierarchy.

[BibT_eX]

Michal P. Chytil

Jörg Vogel

Bull. EATCS, 1985

1982

Composition of Translation Schemes with D-Trees.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Computational Linguistics, 1982

1978

A Scale of Context Sensitive Languages: Applications to Natural Language

[BibT_eX]

[DOI]