Developments in Language Theory (Record no. 188651)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04796nam a22006255i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-45007-8 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423132522.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 | 121227s2003 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540450078 |
| -- | 978-3-540-45007-8 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/3-540-45007-6 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA267-268.5 |
| 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 | 005.131 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Developments in Language Theory |
| Medium | [electronic resource] : |
| Remainder of title | 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings / |
| Statement of responsibility, etc | edited by Zoltán Ésik, Zoltán Fülöp. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2003. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2003. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XI, 436 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 1611-3349 ; |
| Volume number/sequential designation | 2710 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Invited Presentations -- Quantum Computing: 1-Way Quantum Automata -- An Automata-Theoretic Approach to Software Verification -- Comments on Complete Sets of Tree Automata -- On a Conjecture of Schnoebelen -- Restarting Automata and Their Relations to the Chomsky Hierarchy -- Test Sets for Large Families of Languages -- Complexity Theory Made Easy -- Contributions -- Synchronizing Monotonic Automata -- Covering Problems from a Formal Language Point of View -- Regular Languages Generated by Reflexive Finite Splicing Systems -- The Myhill-Nerode Theorem for Recognizable Tree Series -- Generating Series of the Trace Group -- Residual Finite Tree Automata -- From Glushkov WFAs to Rational Expressions -- NFA Reduction Algorithms by Means of Regular Inequalities -- Tile Rewriting Grammars -- Distributed Pushdown Automata Systems: Computational Power -- On Well Quasi-orders on Languages -- Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models -- On Enumeration of Müller Automata -- Branching Grammars: A Generalization of ET0L Systems -- Learning a Regular Tree Language from a Teacher -- On Three Classes of Automata-Like P Systems -- Computing Languages by (Bounded) Local Sets -- About Duval’s Conjecture -- Computation with Absolutely No Space Overhead -- Deleting String Rewriting Systems Preserve Regularity -- On Deterministic Finite Automata and Syntactic Monoid Size, Continued -- Flip-Pushdown Automata: Nondeterminism is Better than Determinism -- Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton -- Minimizing Finite Automata Is Computationally Hard -- Boolean Grammars -- Syntactic Semiring and Universal Automaton -- Alphabetic Pushdown Tree Transducers. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the refereed proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003, held in Szeged, Hungary, in July 2003. The 27 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 57 submissions. All current aspects in language theory are addressed, in particular grammars, acceptors, and transducers for strings, trees, graphs, arrays, etc; algebraic theories for automata and languages; combinatorial properties of words and languages; formal power series; decision problems; efficient algorithms for automata and languages; and relations to complexity theory and logic, picture description and analysis, DNA computing, quantum computing, cryptography, and concurrency. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Social sciences. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Humanities. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| General subdivision | Mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Formal Languages and Automata Theory. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Humanities and Social Sciences. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Science Logic and Foundations of Programming. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Ésik, Zoltán. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Fülöp, Zoltán. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540404347 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783662197844 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 1611-3349 ; |
| Volume number/sequential designation | 2710 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/3-540-45007-6">https://doi.org/10.1007/3-540-45007-6</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 912 ## - | |
| -- | ZDB-2-BAE |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.