Developments in Language Theory: 8th International Conference 语言理论发展/会议录

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and Societies, LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS, including its sub series LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes
　　- Proceedings（published in time for the respective conference）
　 - Post-proceedings（consisting of thoroughly revised final full papers）
　 -research monographs（which may be based on outstanding PhD work, research projects, technical reports, etc.）

Invited papers
　Recognizable Sets of Graphs, Hypergraphs and Relational Structures:A Survey
　Some New Directions and Questions in Parameterized Complexity
　Basic Notions of Reaction Systems
　A Kleene Theorem for a Class of Communicating Automata with
　Effective Algorithms
　Algebraic and Topological Models for DNA Recombinant Processes
Contributed papers
　Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet
　On Competence in CD Grammar Systems
　The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
　Input Reversals and Iterated
　Characterization of Khabbaz
　Pushdown Automata: A New Geomel
　On the Maximum Coefficients of Rational Formal Series in Commuting Variables
　On Codes Defined by Bio-Operations
　Avoidable Sets and Well Quasi-Orders
　A Ciliate Bio-operation and Language Families
　Semantic Shuffle on and Deletion Along Trajectories
　Sturmian Graphs and a Conjecture of Moser
　P Systems Working in the Sequential Mode on Arrays and Strings
　Optimal Time and Communication Solutions of Firing Squad
　Synchronization Problems on Squa
　The Power of Maximal Parallelism in P Systems
　An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
　On the Complexity of 2-Monotone Restarting Automata
　On Left-Monotone Deterministic Restarting Automata
　On the Computation Power of Finite Automata in Two-dimensional　Environments
　The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems
　The Boolean Closure of Linear Context-Free Languages
　Context-Sensitive Decision Problems in Groups
　Decidability and Complexity in Automatic Monoids
　Relating Tree Series Transducers and Weighted Tree Automata
　An NP-Complete Fragment of LTL
　From Post Systems to the Reachability Problems for Matrix
　Semigroups and Multicounter Automata
　Words Avoiding 3/7Powers and The Thue-Morse Morphism
　On the Equivalence Problem for E-pattern Languages over Small　Alphabets
　Complementation of Rational Sets on Countable Scattered Linear　Orderings
　On the Hausdorff Measure of wo-Power Languages
　A Method for Deciding the Finiteness of Deterministic Tabled Picture　Languages
　Tissue P Systems with Minimal Symport/Antiport
Author Index