Developments in Language Theory : 14th International Conference, DLT 2010, London, on, Canada, August 17-20, 2010, Proceedings,9783642144547

Developments in Language Theory : 14th International Conference, DLT 2010, London, on, Canada, August 17-20, 2010, Proceedings

by ; ; ;
ISBN13: 9783642144547
ISBN10: 3642144543
Format: Paperback
Pub. Date: 2010-08-24
Publisher(s): Springer-Verlag New York Inc
List Price: $129.00

Rent Textbook

Select for Price
Add to Cart
There was a problem. Please try again later.

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

Buy from our Marketplace starting at $56.82

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

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 2-page abstract for each of the 6 poster papers. The topics addressed are formal languages, automata theory, computability, complexity, logic, petri nets and related areas.

Table of Contents

Invited Talks
Reaction Systems: A Model of Computation Inspired by Biochemistryp. 1
A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languagesp. 4
The Complexity of Regular(-Like) Expressionsp. 16
On Decision Problems for Simple and Parameterized Machinesp. 31
DNA Computing and Its Implications for Theoretical Computer Sciencep. 32
Numeration Systems: A Link between Number Theory and Formal Language Theoryp. 33
Regular Papers
Algorithmic Properties of Millstream Systemsp. 54
On a Conjecture by Carpi and D'Alessandrop. 66
Linking Algebraic Observational Equivalence and Bisimulationp. 76
Undecidability and Hierarchy Results for Parallel Communicating Finite Automatap. 88
Inclusion Problems for Patterns with a Bounded Number of Variablesp. 100
On the Average Number of States of Partial Derivative Automatap. 112
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Pathsp. 124
Computing Blocker Sets for the Regular Post Embedding Problemp. 136
Rankers over Infinite Words (Extended Abstract)p. 148
Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Latticesp. 160
On Müller Context-Free Grammarsp. 173
Minimization of Deterministic Bottom-Up Tree Transducersp. 185
Two-Way Unary Automata versus Logarithmic Spacep. 197
On the Periodicity of Morphic Wordsp. 209
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groupsp. 218
Using Light to Implement Parallel Boolean Algebrap. 231
Periodicity in Tilingsp. 243
Complexity in Union-Free Regular Languagesp. 255
Schema for Parallel Insertion and Deletionp. 267
On Schützenberger Products of Semiringsp. 279
On Language Equations XXK = XXL and XM = N over a Unary Alphabetp. 291
Around Dot Depth Twop. 303
Input Products for Weighted Extended Top-Down Tree Transducersp. 316
Regular Hedge Language Factorization Revisitedp. 328
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithmp. 340
On Lexicalized Well-Behaved Restarting Automata That Are Monotonep. 352
On a Powerful Class of Non-universal P Systems with Active Membranesp. 364
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languagesp. 376
Restricted Ambiguity of Erasing Morphismsp. 387
Automata with Extremal Minimality Conditionsp. 399
On the Existence of Minimal ß-Powersp. 411
The Averaging Trick and the Cerný Conjecturep. 423
Short Papers
Pseudo-power Avoidancep. 432
On Restricted Context-Free Grammarsp. 434
Graphs Capturing Alternations in Wordsp. 436
On the Iterated Hairpin Completionp. 438
On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)p. 440
Joint Topologies for Finite and Infinite Wordsp. 442
Author Indexp. 445
Table of Contents provided by Ingram. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.