Journal of Automata, Languages and Combinatorics, Volume 9

Volume 9, Number 1, 2004

Zoltán Ésik, Zoltán L. Németh: Higher Dimensional Automata. 3-29
Zoltán Fülöp, Heiko Vogler: Weighted Tree Transducers. 31-54
Ferenc Gécseg, Balázs Imreh: On Definite and Nilpotent DR Tree Languages. 55-60
Giovanna Guaiana, Antonio Restivo, Sergio Salemi: On the Trace Product and some Families of Languages Closed under Partial Commutations. 61-79
Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam: Asymptotically Optimal Low-Cost Solid Codes. 81-102
Jean Neraud, Carla Selmi: A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A^*. 103-110
Yasubumi Sakakibara, Hiroshi Imai: A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. 111-119
Nicolae Santean: Bimachines and Structurally-Reversed Automata. 121-146
Pascal Weil: On the Logical Definability of Certain Graph and Poset Languages. 147-165

Selected Papers of the Fourth International Workshop on Descriptional Complexity of Formal Systems (London, Ontario, Canada, August 21-25, 2002)

Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Description for Basic Constructions on Rational Transductions. 175-188
Cezar Câmpeanu, Wing Hong Ho: The Maximum State Complexity for Finite Languages. 189-202
Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi: Random Generation Models for NFAs. 203-216
Michael Domaratzki, Kai Salomaa: State Complexity of Shuffle on Trajectories. 217-232
Keith Ellul, Bryan Krawetz, Jeffrey Shallit, Ming-wei Wang: Regular Expressions: New Results and Open Problems. 233-256
Mark G. Eramian: Efficient Simulation of Nondeterministic Weighted Finite Automata. 257-267
Cristian Grozea: NP Predicates Computable in the Weakest Level of the Grzegorczyck Hierarchy. 269-279
Martin Kappes, Chandra M. R. Kintala: Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata. 281-292
Lila Kari, Stavros Konstantinidis: Descriptional Complexity of Error/Edit Systems. 293-309
Madhu Mutyam: Descriptional Complexity of Rewriting P Systems. 311-316
Ian McQuillan: Descriptional Complexity of Block-Synchronization Context-Free Grammars. 317-332
Charlotte Miller: Context Derivation Sets and Context-Free Normal Forms. 333-345
Frank Nießner: Büchi Automata and Their Degrees of Nondeterminism and Ambiguity. 347-363
Alexander Okhotin: State Complexity of Linear Conjunctive Grammars. 365-381

Rudolf Freund, Marion Oswald: P Systems with Conditional Communication Rules Assigned to Membranes. 387-397
Michel Latteux: Valence Languages Generated by Equality Sets. 399-406
Friedrich Otto: Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages. 407-437
Sergey Kitaev, Toufik Mansour, Patrice Séébold: Generating the Peano Curve and Counting Occurrences of some Patterns. 439-455
Madhu Mutyam, Kamala Krithivasan: Length Synchronization Context-Free Grammars. 457-464

Last update Mon Feb 13 04:51:16 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page