Developments in Language Theory (Record no. 14789)

000 -LEADER
fixed length control field 04766nam a22004695i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144117.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 130611s2013 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642387715
978-3-642-38771-5
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2013.
912 ## -
-- ZDB-2-SCS
-- ZDB-2-LNC
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Béal, Marie-Pierre.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Developments in Language Theory
Medium [electronic resource] :
Remainder of title 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings /
Statement of responsibility, etc edited by Marie-Pierre Béal, Olivier Carton.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 460 p. 46 illus.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 7907
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Ultrametric Finite Automata and Turing Machines -- Recompression: Word Equations and Beyond -- Joint Spectral Characteristics: A Tale of Three Disciplines -- Unambiguous Finite Automata -- An Explicit Formula for the Intersection of Two Polynomials of Regular Languages -- Two Dimensional Prefix Codes of Pictures -- Adjacent Ordered Multi-Pushdown Systems -- Cuts in Regular Expressions -- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem -- On the Asymptotic Abelian Complexity of Morphic Words -- Strict Bounds for Pattern Avoidance -- A Fresh Approach to Learning Register Automata -- Suffixes, Conjugates and Lyndon Words -- Extremal Words in the Shift Orbit Closure of a Morphic Sequence -- Inner Palindromic Closure -- On the Dual Post Correspondence Problem -- Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata -- A Coloring Problem for Sturmian and Episturmian Words -- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages -- Operational Characterization of Scattered MCFLs -- Abelian Repetitions in Sturmian Words -- Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers -- Subword Complexity and k-Synchronization -- Some Decision Questions Concerning the Time Complexity of Language Acceptors -- Unambiguous Conjunctive Grammars over a One-Letter Alphabet -- Alternative Automata Characterization of Piecewise Testable Languages -- Finite Automata with Advice Tapes -- One-Way Multi-Head Finite Automata with Pebbles But No States -- Regular Expressions with Binding over Data Words for Querying Graph Databases -- Factorizations and Universal Automaton of Omega Languages -- Deciding Determinism of Unary Languages Is coNP-Complete -- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure -- 3-Abelian Cubes Are Avoidable on Binary Alphabets -- Repetition Avoidance in Circular Factors -- Operator Precedence ω-Languages -- New Results on Deterministic Sgraffito Automata -- On the Number of Abelian Bordered Words -- Proof of a Phase Transition in Probabilistic Cellular Automata -- Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the proceedings of the 17th International Conference on Developments in Language Theory, DLT 2013, held in Marne-la-Vallée, France, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference 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 as entry element Computer science.
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Computation by Abstract Devices.
Topical term or geographic name as entry element Mathematical Logic and Formal Languages.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Carton, Olivier.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642387708
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-38771-5
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-01AUM Main Library2014-04-01 2014-04-01 E-Book   AUM Main Library004.0151