Developments in Language Theory
Editat de Masami Ito, Masafumi Toyamaen Limba Engleză Paperback – 20 iun 2003
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 328.72 lei 6-8 săpt. | |
| Springer – 20 iun 2003 | 328.72 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 4 sep 2008 | 333.68 lei 6-8 săpt. |
Preț: 328.72 lei
Preț vechi: 410.90 lei
-20% Nou
Puncte Express: 493
Preț estimativ în valută:
58.16€ • 67.86$ • 50.85£
58.16€ • 67.86$ • 50.85£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540404316
ISBN-10: 3540404317
Pagini: 448
Ilustrații: X, 438 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540404317
Pagini: 448
Ilustrații: X, 438 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Presentations.- Computational Processes in Living Cells: Gene Assembly in Ciliates.- Experimental Quantum Computation with Molecules.- Efficient Transformations from Regular Expressions to Finite Automata.- Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators.- A Remark about Quadratic Trace Equations.- Infinite Snake Tiling Problems.- Decision Problems for Linear and Circular Splicing Systems.- Finite Automata Models of Quantized Systems: Conceptual Status and Outlook.- Automata on Linear Orderings.- Contributions.- Some Properties of Ciliate Bio-operations.- On the Descriptional Complexity of Some Variants of Lindenmayer Systems.- Carriers and Counters.- On the Separation between k-Party and (k - 1)-Party Nondeterministic Message Complexities.- Unary Language Operations and Their Nondeterministic State Complexity.- Constructing Infinite Words of Intermediate Complexity.- A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.- Undecidability of Weak Bisimilarity for PA-Processes.- Improved Bounds on the Number of Automata Accepting Finite Languages.- Roots and Powers of Regular Languages.- Innermost Termination of Context-Sensitive Rewriting.- A Unique Structure of Two-Generated Binary Equality Sets.- On Deterministic Finite Automata and Syntactic Monoid Size.- An Inverse Automata Algorithm for Recognizing 2-Collapsing Words.- Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z - ?*-Automata.- Some Remarks on Asynchronous Automata.- Tiling Systems over Infinite Pictures and Their Acceptance Conditions.- The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.- Circular Words Avoiding Patterns.- Safety Verification for Two-Way Finite Automata withMonotonic Counters.- An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton.- On the Structure of Graphic DLI-Sets.- Finite Completion of Comma-Free Codes. Part I.- On a Family of Codes with Bounded Deciphering Delay.- Abstract Families of Graphs.- Automaton Representation of Linear Conjunctive Languages.- On-Line Odometers for Two-Sided Symbolic Dynamical Systems.- Characteristic Semigroups of Directable Automata.
Textul de pe ultima copertă
This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008.
The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.
The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.