Language and Automata Theory and Applications (Record no. 92129)

000 -LEADER
fixed length control field 06864nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-642-00982-2
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730183953.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 100301s2009 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642009822
-- 978-3-642-00982-2
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-00982-2
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 Language and Automata Theory and Applications
Medium [electronic resource] :
Remainder of title Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings /
Statement of responsibility, etc. edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2009.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2009.
300 ## - PHYSICAL DESCRIPTION
Extent XV, 754 p.
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 PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 5457
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- Recent Developments in Algorithmic Teaching -- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications -- Descriptional and Computational Complexity of Finite Automata -- Hypothesis Spaces for Learning -- State Complexity of Nested Word Automata -- Regular Papers -- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations -- Minimal Union-Free Decompositions of Regular Languages -- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory -- Matching Trace Patterns with Regular Policies -- Absolute Convergence of Rational Series Is Semi-decidable -- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] -- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights -- Refinement and Consistency of Timed Modal Specifications -- Nondeterministic Instance Complexity and Proof Systems with Advice -- How Many Holes Can an Unbordered Partial Word Contain? -- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms -- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization -- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication -- Picture Languages Generated by Assembling Tiles -- Undecidability of Operation Problems for T0L Languages and Subclasses -- Decision Problems for Convex Languages -- On a Family of Morphic Images of Arnoux-Rauzy Words -- Monadic Datalog Tree Transducers -- On Extended Regular Expressions -- Multi-tilde Operators and Their Glushkov Automata -- Non-uniform Cellular Automata -- A Cryptosystem Based on the Composition of Reversible Cellular Automata -- Grammars Controlled by Special Petri Nets -- Nested Counters in Bit-Parallel String Matching -- Bounded Delay andConcurrency for Earliest Query Answering -- Learning by Erasing in Dynamic Epistemic Logic -- The Fault Tolerance of NP-Hard Problems -- Termination of Priority Rewriting -- State Complexity of Combined Operations for Prefix-Free Regular Languages -- Towards a Taxonomy for ECFG and RRPG Parsing -- Counting Parameterized Border Arrays for a Binary Alphabet -- Bounded Hairpin Completion -- Rigid Tree Automata -- Converting Self-verifying Automata into Deterministic Automata -- Two Equivalent Regularizations for Tree Adjoining Grammars -- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching -- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata -- Automata on Gauss Words -- Analysing Complexity in Classes of Unary Automatic Structures -- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words -- Segmentation Charts for Czech - Relations among Segments in Complex Sentences -- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions -- Efficiency of the Symmetry Bias in Grammar Acquisition -- A Series of Run-Rich Strings -- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes -- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates -- Prediction of Creole Emergence in Spatial Language Dynamics -- On the Average Size of Glushkov's Automata -- Tiling the Plane with a Fixed Number of Polyominoes -- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality -- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata -- Finitely Generated Synchronizing Automata -- Genetic Algorithm for Synchronization.-Constructing Infinite Words of Intermediate Arithmetical Complexity -- From Gene Trees to Species Trees through a Supertree Approach -- A Kleene Theorem for Forest Languages -- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions -- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit.
520 ## - SUMMARY, ETC.
Summary, etc. This book constitutes the refereed proceedings of the Third International Conference on Language and Automata Theory and Applications, LATA 2009, held in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Machine theory.
9 (RLIN) 134066
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 Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Formal Languages and Automata Theory.
9 (RLIN) 134067
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of Computation.
9 (RLIN) 134068
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Symbolic and Algebraic Manipulation.
9 (RLIN) 55589
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science Logic and Foundations of Programming.
9 (RLIN) 42203
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics of Computing.
9 (RLIN) 31875
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Dediu, Adrian Horia.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 134069
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ionescu, Armand Mihai.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 134070
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Martin-Vide, Carlos.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 134071
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 134072
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642009815
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642009839
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 5457
9 (RLIN) 134073
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-00982-2">https://doi.org/10.1007/978-3-642-00982-2</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.