Advertisement

Developments in Language Theory

8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004. Proceedings

  • Cristian S. Calude
  • Elena Calude
  • Michael J. Dinneen
Conference proceedings DLT 2004

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3340)

Table of contents

  1. Front Matter
    PDF

  2. Invited Papers

    1. Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
      Bruno Courcelle
      Pages 1-11
    2. Some New Directions and Questions in Parameterized Complexity
      Rodney G. Downey, Catherine McCartin
      Pages 12-26
    3. Basic Notions of Reaction Systems
      A. Ehrenfeucht, G. Rozenberg
      Pages 27-29
    4. A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms
      Blaise Genest, Anca Muscholl, Dietrich Kuske
      Pages 30-48
    5. Algebraic and Topological Models for DNA Recombinant Processes
      Nataša Jonoska, Masahico Saito
      Pages 49-62

  3. Contributed Papers

    1. Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet
      Marcella Anselmo, Dora Giammarresi, Maria Madonia
      Pages 63-75
    2. On Competence in CD Grammar Systems
      Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil
      Pages 76-88
    3. The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
      Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
      Pages 89-101
    4. Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages
      Henning Bordihn, Markus Holzer, Martin Kutrib
      Pages 102-113
    5. On the Maximum Coefficients of Rational Formal Series in Commuting Variables
      Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
      Pages 114-126
    6. On Codes Defined by Bio-operations
      Mark Daley, Michael Domaratzki
      Pages 127-138
    7. Avoidable Sets and Well Quasi-Orders
      Flavio D’Alessandro, Stefano Varricchio
      Pages 139-150
    8. A Ciliate Bio-operation and Language Families
      Jürgen Dassow
      Pages 151-162
    9. Semantic Shuffle on and Deletion Along Trajectories
      Michael Domaratzki
      Pages 163-174
    10. Sturmian Graphs and a Conjecture of Moser
      Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini
      Pages 175-187
    11. P Systems Working in the Sequential Mode on Arrays and Strings
      Rudolf Freund
      Pages 188-199
    12. Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings
      Jozef Gruska, Salvatore La Torre, Mimmo Parente
      Pages 200-211
    13. The Power of Maximal Parallelism in P Systems
      Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
      Pages 212-224
    14. An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
      Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
      Pages 225-236
    15. On the Complexity of 2-Monotone Restarting Automata
      T. Jurdziński, F. Otto, F. Mráz, M. Plátek
      Pages 237-248
    16. On Left-Monotone Deterministic Restarting Automata
      T. Jurdziński, F. Otto, F. Mráz, M. Plátek
      Pages 249-260
    17. On the Computation Power of Finite Automata in Two-Dimensional Environments
      Oleksiy Kurganskyy, Igor Potapov
      Pages 261-271
    18. The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems
      Dietrich Kuske, Peter Weigel
      Pages 272-283
    19. The Boolean Closure of Linear Context-Free Languages
      Martin Kutrib, Andreas Malcher, Detlef Wotschke
      Pages 284-295
    20. Context-Sensitive Decision Problems in Groups
      Stephen R. Lakin, Richard M. Thomas
      Pages 296-307
    21. Decidability and Complexity in Automatic Monoids
      Markus Lohrey
      Pages 308-320
    22. Relating Tree Series Transducers and Weighted Tree Automata
      Andreas Maletti
      Pages 321-333
    23. An NP-Complete Fragment of LTL
      Anca Muscholl, Igor Walukiewicz
      Pages 334-344
    24. From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata
      Igor Potapov
      Pages 345-356
    25. Words Avoiding \(\frac{7}{3}\)-Powers and the Thue–Morse Morphism
      Narad Rampersad
      Pages 357-367
    26. On the Equivalence Problem for E-Pattern Languages Over Small Alphabets
      Daniel Reidenbach
      Pages 368-380
    27. Complementation of Rational Sets on Countable Scattered Linear Orderings
      Chloé Rispal, Olivier Carton
      Pages 381-392
    28. On the Hausdorff Measure of ω-Power Languages
      Ludwig Staiger
      Pages 393-405
    29. A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages
      Bianca Truthe
      Pages 406-417
    30. Tissue P Systems with Minimal Symport/Antiport
      Sergey Verlan
      Pages 418-429
  4. Back Matter
    PDF

About these proceedings

Keywords

Alphabet Monoid P systems automata automata theory combinatorics complexity complexity theory formal language formal languages languae theory language hierarchies regular expressions relational structures rewriting

Editors and affiliations

  • Cristian S. Calude
    • 1
  • Elena Calude
    • 2
  • Michael J. Dinneen
    • 3
  1. 1.Department of Computer ScienceUniversity of AucklandNew Zealand
  2. 2.Computer Science, Institute of Information and Mathematical SciencesMassey University AlbanyAucklandNew Zealand
  3. 3.Department of Computer ScienceUniversity of AucklandAucklandNew Zealand

Bibliographic information

  • DOI https://doi.org/10.1007/b103739
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-24014-3
  • Online ISBN 978-3-540-30550-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site