Karin Harbusch Parsing Contextual Grammars with Linear, Regular and Context-Free Selectors. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:45-54 [Conf]
Maria Dolores Jiménez-López Linguistic Grammar Systems: A Grammar Systems Approach for Natural Language. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:55-66 [Conf]
Martin Kappes Multi-Bracketed Contextual Rewriting Grammars with Obligatory Rewriting. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:67-76 [Conf]
Alexander Meduna, Dusan Kolar Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:91-98 [Conf]
György Vaszil On the Generative Capacity of Parallel Communicating Extended Lindenmayer Systems. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:99-110 [Conf]
Galina Jirásková Note on Minimal Automata and Uniform Communication Protocols. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:163-170 [Conf]
Manfred Kudlek On Universal Finite Automata and a-Transducers. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:171-176 [Conf]
Denis Maurel Electronic Dictionaries and Acyclic Finite-State Automata: A State of the Art. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:177-188 [Conf]
Bruce W. Watson A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:189-202 [Conf]
James D. Currie What Is the Abelian Analogue of Dejean's Conjecture? [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:237-242 [Conf]
Pedro García, José Ruiz Threshold Locally Testable Languages in Strict Sense. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:243-252 [Conf]
Sadaki Hirose, Satoshi Okawa Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:253-262 [Conf]
Juha Honkala On DOL Power Series over Various Semirings. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:263-274 [Conf]
Kenichi Morita A New Universal Logic Element for Reversible Computing. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:285-294 [Conf]
Gundula Niemann, Friedrich Otto Church-Rosser Languages and Their Relationship to Other Language Classes. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:295-304 [Conf]
Ion Petre On the Difference Problem for Semilinear Power Series. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:317-326 [Conf]
Lech Polkowski On Spatial Reasoning via Rough Mereology. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:327-336 [Conf]
Loutfi Soufi Languages and Problem Specification. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:337-346 [Conf]
Avraham Trakhtman The Identities of Local Threshold Testability. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:347-358 [Conf]
Lucian Ilie, Victor Mitrana Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:391-402 [Conf]
