Developments in Language Theory 語言理論的發(fā)展/2005年國(guó)際會(huì)議錄

內(nèi)容概要

This book constitutes the refereed proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, held in Palermo, Italy in July 2005.    The 29 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 73 submissions. All important issues in language theory are addressed including grammars, acceptors, and transducers for strings frees, graphs, and arrays; efficient text algorithms; algebraic theories for automata and languages; variable-length codes; symbolic dynamics; decision problems; relations to complexity theory and logic; picture description and analysis; cryptography; concurrency; DNA computing; and quantum computing.

書籍目錄

Restricted Towers of Hanoi and MorphismsCollapsing Words: A Progress ReportLocally Consistent Parsing and Applications to Approximate String ComparisonsCentral Sturmian Words: Recent Developments Reversible Cellular AutomataInexpressibility Results for Regular Languages in Nonregular Settings Complexity of Quantum Uniform and Nonuniform AutomataMembership and Finiteness Problems for Rational Sets of Regular LanguagesTissue P Systems with Antiport Rules and Small Numbers of Symbols and CellsThe Mortality Threshold for Partially Monotonic AutomataSturmian Words: Dynamical Systems and Derivated WordsSchiitzenberger and Eilenberg Theorems for Words on Linear OrderingsOn the Membership of Invertible Diagonal MatricesA Kleene Theorem for Languages of Words Indexed by Linear OrderingsRevolving-Input Finite AutomataSome New Results on Palindromic Factors of Billiard WordsA Note on a Result of Daurat and NivatPalindromes in Sturmian WordsVoronoi Cells of Beta-IntegersLanguages with Mismatches and an Application to Approximate Indexing.Bidimensional Sturmian Sequences and SubstitutionsUnambiguous Morphic Images of StringsComplementing Two-Way Finite AutomataOn Timed Automata with Discrete Time Structural and Language Theoretical CharacterizationMonotone Deterministic RL-Automata Don't Need Auxiliary Symbols On Hairpin-Free Words and Languages Adding Monotonic Counters to Automata and Transition GraphsPolynomial Generators of Recursively Enumerable LanguagesOn Language Inequalities XK C= LXThe Power of Tree Series Transducers of Type I and II……Author Index

圖書封面

評(píng)論、評(píng)分、閱讀與下載

---

    Developments in Language Theory 語言理論的發(fā)展/2005年國(guó)際會(huì)議錄 PDF格式下載

---