- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c46 |      | Vladislav Kubon, Markéta Lopatková, Martin Plátek: On Formalization of Word Order Properties. CICLing (1) 2012: 130-141 |
| c45 |  | Martin Procházka, Martin Plátek: Taxonomy of Red-Automata Motivated by Error Localization. NCMA 2012: 181-195 |
| 2011 | ||
| j17 | | Dana Pardubská, Frantisek Mráz, Martin Plátek: Translations by Regulated Parallel Communicating Grammar Systems. Journal of Automata, Languages and Combinatorics 16(2-4): 215-251 (2011) |
| j16 | | 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 | ||
| c44 | | Friedrich Otto, Martin Plátek, Frantisek Mráz: On Lexicalized Well-Behaved Restarting Automata That Are Monotone. Developments in Language Theory 2010: 352-363 |
| c43 | | 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 |
| c42 | | Martin Plátek, Frantisek Mráz, Markéta Lopatková: Restarting Automata with Structured Output and Functional Generative Description. LATA 2010: 500-511 |
| c41 | | Martin Plátek, Frantisek Mráz, Markéta Lopatková: (In)Dependencies in Functional Generative Description by Restarting Automata. NCMA 2010: 155-170 |
| 2009 | ||
| j15 | | 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) |
| j14 | | 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) |
| c40 | | Dana Pardubská, Martin Plátek, Friedrich Otto: Parallel Communicating Grammar Systems with Regular Control. CAI 2009: 342-360 |
| c39 | | Dana Pardubská, Martin Plátek, Friedrich Otto: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA 2009: 660-671 |
| 2008 | ||
| j13 | | 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) |
| c38 | | Friedrich Otto, Martin Plátek: A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. LATA 2008: 409-420 |
| 2007 | ||
| j12 | | Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski: Ambiguity by Restarting Automata. Int. J. Found. Comput. Sci. 18(6): 1343-1352 (2007) |
| j11 | | Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel: Monotonicity of Restarting Automata. Journal of Automata, Languages and Combinatorics 12(3): 355-371 (2007) |
| j10 | | 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) |
| c37 | | Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan: A Linguistically-Based Segmentation of Complex Sentences. FLAIRS Conference 2007: 368-373 |
| c36 | | Frantisek Mráz, Friedrich Otto, Martin Plátek: Free Word-Order and Restarting Automata. LATA 2007: 425-436 |
| c35 | | Frantisek Mráz, Friedrich Otto, Martin Plátek: Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. MCU 2007: 230-241 |
| c34 | | Frantisek Mráz, Martin Plátek, Friedrich Otto: A Measure for the Degree of Nondeterminism of Context-Free Languages. CIAA 2007: 192-202 |
| 2006 | ||
| j9 | | 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) |
| j8 | | 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) |
| c33 | | Frantisek Mráz, Friedrich Otto, Martin Plátek: On the Gap-Complexity of Simple RL-Automata. Developments in Language Theory 2006: 83-94 |
| c32 | | Frantisek Mráz, Friedrich Otto, Martin Plátek: Learning Analysis by Reduction from Positive Data. ICGI 2006: 125-136 |
| c31 | | Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan: Segmentation of Complex Sentences. TSD 2006: 151-158 |
| c30 | | Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek: Correctness Preservation and Complexity of Simple RL-Automata. CIAA 2006: 162-172 |
| 2005 | ||
| j7 | | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek: Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Inform. 64(1-4): 217-228 (2005) |
| c29 | | 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 |
| c28 | | Markéta Lopatková, Martin Plátek, Vladislav Kubon: Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction. TSD 2005: 140-147 |
| 2004 | ||
| c27 | | 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 |
| c26 | | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek: On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory 2004: 249-260 |
| 2003 | ||
| c25 | | |
| c24 | | Martin Plátek, Friedrich Otto, Frantisek Mráz: Restarting Automata and Variants of j-Monotonicity. DCFS 2003: 303-312 |
| c23 | | 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 | ||
| c22 | | 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 |
| c21 | | |
| c20 | | Martin Plátek, Tomás Holan, Vladislav Kubon, Karel Oliva: Word-Order Relaxations & Restrictions within a Dependency Grammar. IWPT 2001 |
| c19 | | |
| c18 | | |
| 2000 | ||
| c17 | | 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 |
| 1999 | ||
| j6 | | Frantisek Mráz, Martin Plátek, Martin Procházka: On Special Forms of Restarting Automata. Grammars 2(3): 223-233 (1999) |
| j5 | | Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel: On Monotonic Automata with a Restart Operation. Journal of Automata, Languages and Combinatorics 4(4): 287-312 (1999) |
| j4 | | Martin Plátek: Strict Monotonicity and Restarting Automata. Prague Bull. Math. Linguistics 72: 11-28 (1999) |
| c16 | | |
| 1998 | ||
| c15 | | Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel: Different Types of Monotonicity for Restarting Automata. FSTTCS 1998: 343-354 |
| 1997 | ||
| c14 | | Tomás Holan, Vladislav Kubon, Martin Plátek: A Prototype of a Grammar Checker for Czech. ANLP 1997: 147-154 |
| c13 | | Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel: On Restarting Automata with Rewriting. New Trends in Formal Languages 1997: 119-136 |
| c12 | | 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 |
| c11 | | 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 |
| c10 | | 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 Inf. 33(5): 409-420 (1996) |
| c9 | | |
| 1995 | ||
| c8 | | 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 |
| c7 | | |
| 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 | | |
| 1992 | ||
| c3 | | Petr Jancar, Frantisek Mráz, Martin Plátek: Characterization of Context-Free Languages by Erasing Automata. MFCS 1992: 307-314 |
| 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. Bulletin of the EATCS 27: 23-29 (1985) |
| 1982 | ||
| c1 | | |
| 1978 | ||
| j1 | | Martin Plátek, Petr Sgall: A Scale of Context Sensitive Languages: Applications to Natural Language. Information and Control 38(1): 1-20 (1978) |
Data released under the ODC-BY 1.0 license — See also our legal information page