Developments in Language Theory, 1st ed. 2017 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Charlier Émilie, Leroy Julien, Rigo Michel
This book constitutes the proceedings of the 21st International Conference on Developments in Language Theory, DLT 2017, held in Liège, Belgium, in August 2017.The 24 full papers and 6 (abstract of) invited papers were carefully reviewed and selected from 47 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars acceptors and transducers for strings, trees, graphics, 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 bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspiredcomputing; quantum computing.
Combinatorial and algebraic properties of words and languages.- Grammars acceptors and transducers for strings, trees, graphics, 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 bidimensional patterns.- Cryptography; concurrency.- Celluar automata.- Bio-inspiredcomputing.- Quantum computing.
Includes supplementary material: sn.pub/extras
Date de parution : 07-2017
Ouvrage de 379 p.
15.5x23.5 cm
Thèmes de Developments in Language Theory :
Mots-clés :
Formal languages and automata theory; Grammars and context-free languages; Tree languages; Transducers; Regular languages; Complexity theory and logic; Logic and verification; Proof theory; Modal and temporal logics; Combinatorics on words; Graph theory; Trees; Complexity classes; Problems; reductions and completeness; Proof complexity; Complexity theory and logic; Number-theoretic computations; Algorithmic game theory; Model checking; algorithm analysis and problem complexity