default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIn Honour of Gheorghe Paun , 2003
- Carlos Martín-Vide, Victor Mitrana:
Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back: Essays in Honour of Gheorghe Paun. Topics in Computer Mathematics 9, Taylor and Francis 2003, ISBN 0415298857 - Marloes Boon-van der Nat, Grzegorz Rozenberg:
Gheorghe Paun and the Windmill Curiosity. Grammars and Automata for String Processing 2003: 1-8
I. Grammars and Grammar Systems
- Maurice H. ter Beek:
Animal Farm: An Eco-Grammar System. Grammars and Automata for String Processing 2003: 9-16 - Stefano Crespi-Reghizzi, Valentino Braitenberg:
Towards a Brain Compatible Theory of Syntax Based on Local Testability. Grammars and Automata for String Processing 2003: 17-32 - Sigrid Ewert, Andries P. J. van der Walt:
The Power and Limitations of Random Context. Grammars and Automata for String Processing 2003: 33-44 - Karin Harbusch:
Parsing Contextual Grammars with Linear, Regular and Context-Free Selectors. Grammars and Automata for String Processing 2003: 45-54 - María Dolores Jiménez-López:
Linguistic Grammar Systems: A Grammar Systems Approach for Natural Language. Grammars and Automata for String Processing 2003: 55-66 - Martin Kappes:
Multi-Bracketed Contextual Rewriting Grammars with Obligatory Rewriting. Grammars and Automata for String Processing 2003: 67-76 - Jaroslav Král, Michal Zemlicka:
Semi-Top-Down Syntax Analysis. Grammars and Automata for String Processing 2003: 77-90 - 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: 91-98 - György Vaszil:
On the Generative Capacity of Parallel Communicating Extended Lindenmayer Systems. Grammars and Automata for String Processing 2003: 99-110
II. Automata
- Manuel Alfonseca, Alfonso Ortega, Alberto Suárez:
Cellular Automata and Probabilistic L Systems: An Example in Ecology. Grammars and Automata for String Processing 2003: 111-120 - Henning Bordihn, Henning Fernau, Markus Holzer:
On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130 - Catalin Dima:
Distributed Real-Time Automata. Grammars and Automata for String Processing 2003: 131-140 - Balázs Imreh, Masami Ito, Magnus Steinby:
On Commutative Directable Nondeterministic Automata. Grammars and Automata for String Processing 2003: 141-150 - Florentin Ipate, Mike Holcombe:
Testing Non-Deterministic X-Machines. Grammars and Automata for String Processing 2003: 151-162 - Galina Jirásková:
Note on Minimal Automata and Uniform Communication Protocols. Grammars and Automata for String Processing 2003: 163-170 - Manfred Kudlek:
On Universal Finite Automata and a-Transducers. Grammars and Automata for String Processing 2003: 171-176 - Denis Maurel:
Electronic Dictionaries and Acyclic Finite-State Automata: A State of the Art. Grammars and Automata for String Processing 2003: 177-188 - Bruce W. Watson:
A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata. Grammars and Automata for String Processing 2003: 189-202
III. Logics, Languages and Combinatorics
- Wojciech Buszkowski:
Syntactic Calculus and Pregroups. Grammars and Automata for String Processing 2003: 203-214 - Virgil Emil Cazanescu, Manfred Kudlek:
Homomorphic Characterizations of Linear and Algebraic Languages. Grammars and Automata for String Processing 2003: 215-224 - Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino, Marianna Salurso:
Using Alternating Words to Describe Symbolic Pictures. Grammars and Automata for String Processing 2003: 225-236 - James D. Currie:
What Is the Abelian Analogue of Dejean's Conjecture? Grammars and Automata for String Processing 2003: 237-242 - Pedro García, José Ruiz:
Threshold Locally Testable Languages in Strict Sense. Grammars and Automata for String Processing 2003: 243-252 - Sadaki Hirose, Satoshi Okawa:
Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms. Grammars and Automata for String Processing 2003: 253-262 - Juha Honkala:
On DOL Power Series over Various Semirings. Grammars and Automata for String Processing 2003: 263-274 - Carlo Mereghetti, Giovanni Pighizzini:
The World of Unary Languages: A Quick Tour. Grammars and Automata for String Processing 2003: 275-284 - Kenichi Morita:
A New Universal Logic Element for Reversible Computing. Grammars and Automata for String Processing 2003: 285-294 - Gundula Niemann, Friedrich Otto:
Church-Rosser Languages and Their Relationship to Other Language Classes. Grammars and Automata for String Processing 2003: 295-304 - Valtteri Niemi:
Hiding Regular Languages. Grammars and Automata for String Processing 2003: 305-316 - Ion Petre:
On the Difference Problem for Semilinear Power Series. Grammars and Automata for String Processing 2003: 317-326 - Lech Polkowski:
On Spatial Reasoning via Rough Mereology. Grammars and Automata for String Processing 2003: 327-336 - Loutfi Soufi:
Languages and Problem Specification. Grammars and Automata for String Processing 2003: 337-346 - Avraham Trakhtman:
The Identities of Local Threshold Testability. Grammars and Automata for String Processing 2003: 347-358
IV. Models of Molecular Computing
- 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: 359-368 - Ethan M. Coven, Natasa Jonoska:
DNA Hybridization, Shifts of Finite Type, and Tiling of the Integers. Grammars and Automata for String Processing 2003: 369-380 - Rudolf Freund, Franziska Freund:
Generalized Homogeneous P-Systems. Grammars and Automata for String Processing 2003: 381-390 - Lucian Ilie, Victor Mitrana:
Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination. Grammars and Automata for String Processing 2003: 391-402 - Carlos Martín-Vide, Alfonso Rodríguez-Patón:
Restricted Concatenation Inspired by DNA Strand Assembly. Grammars and Automata for String Processing 2003: 403-412 - George Rahonis:
DNA Tree Structures. Grammars and Automata for String Processing 2003: 413-420
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 18:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
