Developments in Language Theory

18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings

Arseny M. Shur, Mikhail V. Volkov (Herausgeber)

Buch | Softcover

XVIII, 349 Seiten

2014 | 2014
Springer International Publishing (Verlag)
978-3-319-09697-1 (ISBN)

Artikel merken

This book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on 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 and Quantum Computing.

Finite Automata and Regular Languages On Automatic Transitive Graphs.- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.- On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States.- State Complexity of Deletion.- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.- On two Algorithmic Problems about Synchronizing Automata (short paper).- Synchronizing Automata with Random Inputs (short paper).- Graph Spectral Properties of Deterministic Finite Automata (short paper).- Pushdown Automata and Related Models.- Input-Driven Pushdown Automata with Limited Nondeterminism (invited paper).- How to Remove the Look-Ahead of Top-Down Tree Transducers.- Scope-Bounded Pushdown Languages.- Visibly Pushdown Transducers with Well-nested Outputs.- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing.- Pumping Lemma and Ogden Lemma for Displacement Context-free Grammars.- Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy .- On k-Abelian Pattern Matching.- On k-Abelian Palindromic Rich and Poor Words.- Variations of The Morse{Hedlund Theorem for k-Abelian Equivalence.- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.- Knight Tiles: Particles and Collisions in The Realm of 4-Way Deterministic Tilings .- Eigenvalues and Transduction of Morphic Sequences.- Breadth-First Serialisation of Trees and Rational Languages (short paper).- Algebraic, Decidability and Complexity Problems for Languages Measuring Communication in Automata Systems (invited paper).- From Algebra to Logic: There and Back Again { The Story of A Hierarchy (invited paper).- Closure Properties of Pattern Languages.- Minimal and Hyper-Minimal Biautomata.- Deterministic Set Automata.- The Minimum Amount of Useful Space: New Results and New Directions.- Debates with Small Transparent Quantum Verifiers.- Embedding Finite and Infinite Words into OverlappingTiles.

Erscheint lt. Verlag	4.8.2014
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XVIII, 349 p. 51 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	563 g
Themenwelt	Informatik ► Software Entwicklung ► User Interfaces (HCI)
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik
Schlagworte	Algebraic Language Theory • Algorithm analysis and problem complexity • Cellular Automata • context-free languages • decidability and complexity in language theory • Finite Automata • formal languages and automata theory • Quantum Computing • Regular Expressions • regular languages • transducers • Tree Languages
ISBN-10	3-319-09697-4 / 3319096974
ISBN-13	978-3-319-09697-1 / 9783319096971
Zustand	Neuware