Description 
1 online resource (xii, 446 pages) : illustrations 
Series 
Lecture notes in computer science, 03029743 ; 6224 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 6224. 03029743


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Contents 
Invited Talks  Reaction Systems: A Model of Computation Inspired by Biochemistry  A Brief Excursion Inside the Class of Tiling Recognizable TwoDimensional Languages  The Complexity of Regular( Like) Expressions  On Decision Problems for Simple and Parameterized Machines  DNA Computing and Its Implications for Theoretical Computer Science  Numeration Systems: A Link between Number Theory and Formal Language Theory  Regular Papers  Algorithmic Properties of Millstream Systems  On a Conjecture by Carpi and D'Alessandro  Linking Algebraic Observational Equivalence and Bisimulation  Undecidability and Hierarchy Results for Parallel Communicating Finite Automata  Inclusion Problems for Patterns with a Bounded Number of Variables  On the Average Number of States of Partial Derivative Automata  On the Hybrid?ernýRoad Coloring Problem and Hamiltonian Paths  Computing Blocker Sets for the Regular Post Embedding Problem  Rankers over Infinite Words  Kleene and Büchi Theorems for Weighted Automata and Multivalued Logics over Arbitrary Bounded Lattices  On Müller ContextFree Grammars  Minimization of Deterministic BottomUp Tree Transducers  TwoWay Unary Automata versus Logarithmic Space  On the Periodicity of Morphic Words  Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups  Using Light to Implement Parallel Boolean Algebra  Periodicity in Tilings  Complexity in UnionFree Regular Languages  Schema for Parallel Insertion and Deletion  On Schützenberger Products of Semirings  On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet  Around Dot Depth Two  Input Products for Weighted Extended TopDown Tree Transducers  Regular Hedge Language Factorization Revisited  Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm  On Lexicalized WellBehaved Restarting Automata That Are Monotone  On a Powerful Class of Nonuniversal P Systems with Active Membranes  State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages  Restricted Ambiguity of Erasing Morphisms  Automata with Extremal Minimality Conditions  On the Existence of Minimal?Powers  The Averaging Trick and the?erný Conjecture  Short Papers  Pseudopower Avoidance  On Restricted ContextFree Grammars  Graphs Capturing Alternations in Words  On the Iterated Hairpin Completion  On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)  Joint Topologies for Finite and Infinite Words 
Summary 
Annotation This book constitutes the proceedings of the 14th International Conference on Developments in Language Theory, DLT 2010, held in London, Ontario, Canada, in August 2010. The 32 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or abstracts of 6 invited speakers, as well as a 2page abstract for each of the 6 poster papers. The topics addressed are formal languages, automata theory, computability, complexity, logic, petri nets and related areas 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Formal languages  Congresses.


Programming Languages.

Genre/Form 
Conference papers and proceedings.


Congress.


Conference papers and proceedings.

Form 
Electronic book

Author 
China (Republic : 1949 ). Gao deng fa yuan.

LC no. 
2010930708 
ISBN 
9783642144554 

3642144551 
