Developments in Language Theory (Record no. 53697)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04821nam a22005415i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-09698-8 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421111159.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 140818s2014 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319096988 |
| -- | 978-3-319-09698-8 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.0151 |
| 245 10 - TITLE STATEMENT | |
| Title | Developments in Language Theory |
| Sub Title | 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XVIII, 349 p. 51 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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 Overlapping Tiles. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Shur, Arseny M. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Volkov, Mikhail V. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-09698-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2014. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computation by Abstract Devices. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete Mathematics in Computer Science. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.