Developments in Language Theory (Record no. 93540)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04721nam a22005775i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-21500-6 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730190944.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 150717s2015 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783319215006 |
| -- | 978-3-319-21500-6 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-319-21500-6 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Developments in Language Theory |
| Medium | [electronic resource] : |
| Remainder of title | 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. / |
| Statement of responsibility, etc. | edited by Igor Potapov. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2015. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Cham : |
| Name of producer, publisher, distributor, manufacturer | Springer International Publishing : |
| -- | Imprint: Springer, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2015. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XXI, 440 p. 71 illus. |
| Other physical details | online resource. |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS | |
| File type | text file |
| Encoding format | |
| Source | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume/sequential designation | 9168 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Recognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, 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 bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer science. |
| 9 (RLIN) | 9832 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Machine theory. |
| 9 (RLIN) | 144602 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms. |
| 9 (RLIN) | 3390 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer science |
| General subdivision | Mathematics. |
| 9 (RLIN) | 3866 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Discrete mathematics. |
| 9 (RLIN) | 12873 |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Theory of Computation. |
| 9 (RLIN) | 144603 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Formal Languages and Automata Theory. |
| 9 (RLIN) | 144604 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms. |
| 9 (RLIN) | 3390 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Discrete Mathematics in Computer Science. |
| 9 (RLIN) | 31837 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Potapov, Igor. |
| Relator term | editor. |
| Relationship | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 9 (RLIN) | 144605 |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 9 (RLIN) | 144606 |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783319214993 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783319215013 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume/sequential designation | 9168 |
| 9 (RLIN) | 144607 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-3-319-21500-6">https://doi.org/10.1007/978-3-319-21500-6</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-Lecture Notes in CS |
No items available.