Developments in Language Theory : 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002 - Revised Papers
by Conference on Developments in Language Theory 2002 (Tokyo, Japan); Ito, Masami; Toyama, MasafumiFormat: Paperback
Pub. Date: 2003-07-01
Publisher(s): Springer Verlag
Other versions by this Author
List Price: $119.00
Rent Textbook
Select for Price
Rent Digital
$42.90*
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
Summary
This book constitutes the refereed proceedings of the 6th International Conference on Developments in Language Theory, DLT 2002, held in Kyoto, Japan in September 2002. The 28 revised full papers presented together with 8 invited papers were carefully reviewed and selected from 63 submissions. Among the topics addressed are grammars and acceptors for strings, graphs, arrays, etc; efficient algorithms for languages; combinatorial and algebraic properties of languages; decision problems; relations to complexity theory, logic picture description and analysis, DNA computing, cryptography, concurrency, quantum computing, and algebraic systems.
Table of Contents
| Computational Processes in Living Cells: Gene Assembly in Ciliates | p. 1 |
| Experimental Quantum Computation with Molecules | p. 21 |
| Efficient Transformations from Regular Expressions to Finite Automata | p. 28 |
| Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators | p. 43 |
| A Remark about Quadratic Trace Equations | p. 59 |
| Infinite Snake Tiling Problems | p. 67 |
| Decision Problems for Linear and Circular Splicing Systems | p. 78 |
| Finite Automata Models of Quantized Systems: Conceptual Status and Outlook | p. 93 |
| Automata on Linear Orderings | p. 103 |
| Some Properties of Ciliate Bio-operations | p. 116 |
| On the Descriptional Complexity of Some Variants of Lindenmayer Systems | p. 128 |
| Carriers and Counters - P Systems with Carriers vs. (Blind) Counter Automata | p. 140 |
| On the Separation between k-Party and (k - 1)-Party Nondeterministic Message Complexities | p. 152 |
| Unary Language Operations and Their Nondeterministic State Complexity | p. 162 |
| Constructing Infinite Words of Intermediate Complexity | p. 173 |
| A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines | p. 185 |
| Undecidability of Weak Bisimilarity for PA-Processes | p. 197 |
| Improved Bounds on the Number of Automata Accepting Finite Languages | p. 209 |
| Roots and Powers of Regular Languages | p. 220 |
| Innermost Termination of Context-Sensitive Rewriting | p. 231 |
| A Unique Structure of Two-Generated Binary Equality Sets | p. 245 |
| On Deterministic Finite Automata and Syntactic Monoid Size | p. 258 |
| An Inverse Automata Algorithm for Recognizing 2-Collapsing Words | p. 270 |
| Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z - [Sigma] - Automata | p. 283 |
| Some Remarks on Asynchronous Automata | p. 290 |
| Tiling Systems over Infinite Pictures and Their Acceptance Conditions | p. 297 |
| The Average Lengths of the Factors of the Standard Factorization of Lyndon Words | p. 307 |
| Circular Words Avoiding Patterns | p. 319 |
| Safety Verification for Two-Way Finite Automata with Monotonic Counters | p. 326 |
| An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton | p. 339 |
| On the Structure of Graphic DLI-Sets | p. 349 |
| Finite Completion of Comma-Free Codes. Part I | p. 357 |
| On a Family of Codes with Bounded Deciphering Delay | p. 369 |
| Abstract Families of Graphs | p. 381 |
| Automaton Representation of Linear Conjunctive Languages | p. 393 |
| On-Line Odometers for Two-Sided Symbolic Dynamical Systems | p. 405 |
| Characteristic Semigroups of Directable Automata | p. 417 |
| Author Index | p. 429 |
| Table of Contents provided by Blackwell. 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.