Languages Alive
暂无分享,去创建一个
[1] Martin Kutrib,et al. On stateless deterministic restarting automata , 2009, Acta Informatica.
[2] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[3] Friedrich Otto,et al. Globally Deterministic CD-Systems of Stateless R(1)-Automata , 2011, LATA.
[4] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[5] Martin Kutrib,et al. On Stateless Two-Pushdown Automata and Restarting Automata , 2010, Int. J. Found. Comput. Sci..
[6] K. Mehlhorn. Pebbling Moutain Ranges and its Application of DCFL-Recognition , 1980, ICALP.
[7] Gheorghe Paun,et al. Grammar Systems , 1997, Handbook of Formal Languages.
[8] Alexander Meduna,et al. Scattered Context Grammars and Their Applications , 2010 .
[9] Kai Salomaa,et al. Limitations of lower bound methods for deterministic nested word automata , 2011, Inf. Comput..
[10] Alexander Meduna,et al. Nonterminal complexity of one-sided random context grammars , 2012, Acta Informatica.
[11] Volker Diekert,et al. The Book of Traces , 1995 .
[12] Friedrich Otto,et al. Cooperating Distributed Systems of Restarting Automata , 2007, Int. J. Found. Comput. Sci..
[13] Carlo Mereghetti,et al. Optimal Simulations Between Unary Automata , 1998, STACS.
[14] Friedrich Otto,et al. Strictly Deterministic CD-Systems of Restarting Automata , 2007, FCT.
[15] Friedrich Otto,et al. CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages , 2010, LATA.
[16] Alexander Okhotin. Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages , 2011, SOFSEM.
[17] Gennaro Parlato,et al. The tree width of auxiliary storage , 2011, POPL '11.
[18] Valeria Mihalache,et al. Matrix Grammars versus Parallel Communicating Grammar Systems , 1994, Mathematical Aspects of Natural and Formal Languages.
[19] Daniel J. Rosenkrantz,et al. Programmed Grammars and Classes of Formal Languages , 1969, JACM.
[20] Wojciech Rytter. An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages , 1986, Inf. Process. Lett..
[21] Oscar H. Ibarra,et al. On stateless multihead automata: Hierarchies and the emptiness problem , 2008, Theor. Comput. Sci..
[22] Jules Moreau,et al. Molecular Computation by DNA Hairpin Formation , 2000 .
[23] Alexander Okhotin,et al. State Complexity of Operations on Input-Driven Pushdown Automata , 2011, MFCS.
[24] Nivat G. Päun,et al. Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.
[25] Alexander Okhotin,et al. Descriptional Complexity of Unambiguous Nested Word Automata , 2011, LATA.
[26] Jirí Srba,et al. Height-Deterministic Pushdown Automata , 2007, MFCS.
[27] Christopher Culy,et al. Formal properties of natural language and linguistic theories , 1996 .
[28] Gheorghe Paun,et al. Hairpin Languages , 2001, Int. J. Found. Comput. Sci..
[29] Kai Salomaa,et al. Operational state complexity of nested word automata , 2008, Theor. Comput. Sci..
[30] Jeffrey Shallit,et al. A Second Course in Formal Languages and Automata Theory , 2008 .
[31] Paliath Narendran,et al. Church-Rosser Thue systems and formal languages , 1988, JACM.
[32] Alexander Meduna,et al. Canonical scattered context generators of sentences with their parses , 2007, Theor. Comput. Sci..
[33] Martin Kutrib,et al. Succinct description of regular languages by weak restarting automata , 2007, Inf. Comput..
[34] Alexander Okhotin. Unambiguous finite automata over a unary alphabet , 2012, Inf. Comput..
[35] Helmut Seidl,et al. Locating Matches of Tree Patterns in Forests , 1998, FSTTCS.
[36] Alexander Meduna,et al. One-sided random context grammars , 2011, Acta Informatica.
[37] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .
[38] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .