Grammars and Automata for String Processing

Keyphrases

Publications

2003

Avraham Trakhtman
The Identities of Local Threshold Testability. Grammars and Automata for String Processing (2003)
Sigrid Ewert, Andries P. J. van der Walt
The Power and Limitations of Random Context. Grammars and Automata for String Processing (2003)
Balázs Imreh, Masami Ito, Magnus Steinby
On Commutative Directable Nondeterministic Automata. Grammars and Automata for String Processing (2003)
Jaroslav Král, Michal Zemlicka
Semi-Top-Down Syntax Analysis. Grammars and Automata for String Processing (2003)
Alexander Meduna, Dusan Kolár
Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals. Grammars and Automata for String Processing (2003)
Maurice H. ter Beek
Animal Farm: An Eco-Grammar System. Grammars and Automata for String Processing (2003)
Virgil Emil Cazanescu, Manfred Kudlek
Homomorphic Characterizations of Linear and Algebraic Languages. Grammars and Automata for String Processing (2003)
Carlo Mereghetti, Giovanni Pighizzini
The World of Unary Languages: A Quick Tour Grammars and Automata for String Processing (2003)
Lech Polkowski
On Spatial Reasoning via Rough Mereology. Grammars and Automata for String Processing (2003)
George Rahonis
DNA Tree Structures. Grammars and Automata for String Processing (2003)
Sadaki Hirose, Satoshi Okawa
Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms. Grammars and Automata for String Processing (2003)
Juha Honkala
On DOL Power Series over Various Semirings. Grammars and Automata for String Processing (2003)
György Vaszil
On the Generative Capacity of Parallel Communicating Extended Lindenmayer Systems. Grammars and Automata for String Processing (2003)
Ion Petre
On the Difference Problem for Semilinear Power Series. Grammars and Automata for String Processing (2003)
Carlos Martín-Vide, Alfonso Rodríguez-Patón
Restricted Concatenation Inspired by DNA Strand Assembly Grammars and Automata for String Processing (2003)
Rudolf Freund, Franziska Freund
Generalized Homogeneous P-Systems. Grammars and Automata for String Processing (2003)
James D. Currie
What Is the Abelian Analogue of Dejean's Conjecture? Grammars and Automata for String Processing (2003)
Catalin Dima
Distributed Real-Time Automata. Grammars and Automata for String Processing (2003)
Pedro García, José Ruiz
Threshold Locally Testable Languages in Strict Sense. Grammars and Automata for String Processing (2003)
Maria Dolores Jiménez-López
Linguistic Grammar Systems: A Grammar Systems Approach for Natural Language. Grammars and Automata for String Processing (2003)
Henning Bordihn, Henning Fernau, Markus Holzer
On Iterated Sequential Transducers. Grammars and Automata for String Processing (2003)
Marloes Boon-van der Nat, Grzegorz Rozenberg
Gheorghe Paun and the Windmill Curiosity. Grammars and Automata for String Processing (2003)
Ruxandra Chiurtu, Alexandru Agapie, Manuela Buzoianu, Florin Oltean, Marius Giuclea, Roxana Vasilco
Soft Computing Modeling of Microbial Metabolism. Grammars and Automata for String Processing (2003)
Loutfi Soufi
Languages and Problem Specification. Grammars and Automata for String Processing (2003)
Gundula Niemann, Friedrich Otto
Church-Rosser Languages and Their Relationship to Other Language Classes. Grammars and Automata for String Processing (2003)
Galina Jirásková
Note on Minimal Automata and Uniform Communication Protocols. Grammars and Automata for String Processing (2003)
Florentin Ipate, Mike Holcombe
Testing Non-Deterministic X-Machines. Grammars and Automata for String Processing (2003)
Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino, Marianna Salurso
Using Alternating Words to Describe Symbolic Pictures. Grammars and Automata for String Processing (2003)
Lucian Ilie, Victor Mitrana
Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination. Grammars and Automata for String Processing (2003)
Bruce W. Watson
A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata. Grammars and Automata for String Processing (2003)
Ethan M. Coven, Natasa Jonoska
DNA Hybridization, Shifts of Finite Type, and Tiling of the Integers. Grammars and Automata for String Processing (2003)
Manuel Alfonseca, Alfonso Ortega, Alberto Suárez
Cellular Automata and Probabilistic L Systems: An Example in Ecology. Grammars and Automata for String Processing (2003)
Wojciech Buszkowski
Syntactic Calculus and Pregroups. Grammars and Automata for String Processing (2003)
Martin Kappes
Multi-Bracketed Contextual Rewriting Grammars with Obligatory Rewriting. Grammars and Automata for String Processing (2003)
Kenichi Morita
A New Universal Logic Element for Reversible Computing. Grammars and Automata for String Processing (2003)
Manfred Kudlek
On Universal Finite Automata and a-Transducers. Grammars and Automata for String Processing (2003)
Karin Harbusch
Parsing Contextual Grammars with Linear, Regular and Context-Free Selectors. Grammars and Automata for String Processing (2003)
Valtteri Niemi
Hiding Regular Languages. Grammars and Automata for String Processing (2003)
Denis Maurel
Electronic Dictionaries and Acyclic Finite-State Automata: A State of the Art. Grammars and Automata for String Processing (2003)
Stefano Crespi-Reghizzi, Valentino Braitenberg
Towards a Brain Compatible Theory of Syntax Based on Local Testability. Grammars and Automata for String Processing (2003)

volume 9, 2003

Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back: Essays in Honour of Gheorghe Paun Grammars and Automata for String Processing 9 (2003)