Developments in Language Theory
Springer Berlin (Verlag)
978-3-662-53131-0 (ISBN)
This book constitutes the proceedings of the 20th International Conference on Developments in Language Theory, DLT 2016, held in Montreal, QC, Canada, in July 2016.
The 32 full papers and 4 abstracts of invited papers presented were carefully reviewed and selected from 48 submissions. This volume presents current developments in formal languages and automata, especially from the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimentional patterns; cryptography; concurrency; cellular automata; bio-inspried computing; quantum computing.
Formal languages and automata.- Combinatorial and algebraic properties of words and languages.- Grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages.- Codes; efficient text algorithms.- Symbolic dynamics; decision problems.- Relationships to complexity theory and logic; picture description and analysis.- Polyominoes and bidimentional patterns; cryptography; concurrency.- Cellular automata; bio-inspried computing; quantum computing.
| Erscheinungsdatum | 08.10.2016 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XVII, 407 p. 48 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
| Mathematik / Informatik ► Informatik ► Theorie / Studium | |
| Schlagworte | Algorithm analysis and problem complexity • Applications • Automata • bounded languages • Combinatorics on Words • Computational Complexity • computation by abstract devices • Computer Science • conference proceedings • Context-Sensitive Languages • hyperwords • independent systems • infinite graphs • Informatics • language operations • NP-hardness • Ordered rewriting • perfect languages • quantitative tree automata • regular languages • Research • Streaming • timed languages • transducer • turing transducers • weighted tree automata |
| ISBN-10 | 3-662-53131-3 / 3662531313 |
| ISBN-13 | 978-3-662-53131-0 / 9783662531310 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
