Language and Automata Theory and Applications (Record no. 46961)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 10084nam a22006017a 4500 |
| 001 - CONTROL NUMBER | |
| control field | sulb-eb0024869 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | BD-SySUS |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20160413122500.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 | 130321s2013 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642370649 |
| -- | 978-3-642-37064-9 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-37064-9 |
| 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 | UYZG |
| Source | bicssc |
| Subject category code | COM037000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Language and Automata Theory and Applications |
| Medium | [electronic resource] : |
| Remainder of title | 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / |
| Statement of responsibility, etc. | edited by Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe. |
| 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 | 2013. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIV, 580 p. 69 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 | Lecture Notes in Computer Science, |
| International Standard Serial Number | 0302-9743 ; |
| Volume/sequential designation | 7810 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Complexity Dichotomy for Counting Problems.- Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking.- Discrete Linear Dynamical Systems.- XML Schema Management: A Challenge for Automata Theory -- On the Complexity of Shortest Path Problems on Discounted Cost Graphs.- Termination of Rule-Based Calculi for Uniform Semi-Unification.- Deciding WQO for Factorial Languages.- On the Construction of a Family of Automata That Are Generically Non-minimal.- Limited Non-determinism Hierarchy of Counter Automata.- Unambiguous Automata Denoting Finitely Sequential Functions.- Duplication-Loss Genome Alignment: Complexity and Algorithm.- Maximizing Entropy over Markov Processes.- MAT Learning of Universal Automata.- A Graph Polynomial Approach to Primitivity.- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.- Dynamic Communicating Automata and Branching High-Level MSCs.- Visibly Pushdown Automata: Universality and Inclusion via Antichains -- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.- How to Travel between Languages.- Execution Information Rate for Some Classes of Automata.- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks.- The Buffered π-Calculus: A Model for Concurrent Languages.- Mix-Automatic Sequences.- A Multivariate Analysis of Some DFA Problems -- On the Size Complexity of Deterministic Frequency Automata -- On the Number of Unbordered Factors -- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences.- Efficient Submatch Extraction for Practical Regular Expressions.- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers -- Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.- On Bounded Languages and Reversal-Bounded Automata.- Rewrite Closure and CF Hedge Automata.- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing.-From Regular Tree Expression to Position Tree Automaton -- Convergence of Newton’s Method over Commutative Semirings -- Counting Minimal Symmetric Difference NFAs -- Interval Logics and ωB-Regular Languages.- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars.- Asynchronous PC Systems of Pushdown Automata -- Model Checking Metric Temporal Logic over Automata with One Counter.- Coinductive Proof Techniques for Language Equivalence.- Ostrowski Numeration and the Local Period of Sturmian Words.- Boolean Algebras of Regular ω-Languages.- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars.- Online Matching of Multiple Regular Patterns with Gaps and Character Classes.- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems.- Uniformisation of Two-Way Transducers.- A Conditional Superpolynomial Lower Bound for Extended Resolution -- A Turing Machine Distance Hierarchy. Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking.- Discrete Linear Dynamical Systems.- XML Schema Management: A Challenge for Automata Theory -- On the Complexity of Shortest Path Problems on Discounted Cost Graphs.- Termination of Rule-Based Calculi for Uniform Semi-Unification.- Deciding WQO for Factorial Languages.- On the Construction of a Family of Automata That Are Generically Non-minimal.- Limited Non-determinism Hierarchy of Counter Automata.- Unambiguous Automata Denoting Finitely Sequential Functions.- Duplication-Loss Genome Alignment: Complexity and Algorithm.- Maximizing Entropy over Markov Processes.- MAT Learning of Universal Automata.- A Graph Polynomial Approach to Primitivity.- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.- Dynamic Communicating Automata and Branching High-Level MSCs.- Visibly Pushdown Automata: Universality and Inclusion via Antichains -- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.- How to Travel between Languages.- Execution Information Rate for Some Classes of Automata.- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks.- The Buffered π-Calculus: A Model for Concurrent Languages.- Mix-Automatic Sequences.- A Multivariate Analysis of Some DFA Problems -- On the Size Complexity of Deterministic Frequency Automata -- On the Number of Unbordered Factors -- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences.- Efficient Submatch Extraction for Practical Regular Expressions.- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers -- Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.- On Bounded Languages and Reversal-Bounded Automata.- Rewrite Closure and CF Hedge Automata.- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing.-From Regular Tree Expression to Position Tree Automaton -- Convergence of Newton’s Method over Commutative Semirings -- Counting Minimal Symmetric Difference NFAs -- Interval Logics and ωB-Regular Languages.- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars.- Asynchronous PC Systems of Pushdown Automata -- Model Checking Metric Temporal Logic over Automata with One Counter.- Coinductive Proof Techniques for Language Equivalence.- Ostrowski Numeration and the Local Period of Sturmian Words.- Boolean Algebras of Regular ω-Languages.- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars.- Online Matching of Multiple Regular Patterns with Gaps and Character Classes.- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems.- Uniformisation of Two-Way Transducers.- A Conditional Superpolynomial Lower Bound for Extended Resolution -- A Turing Machine Distance Hierarchy. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This book constitutes the refereed proceedings of the 7th International Conference on Language and Automata Theory and Applications, LATA 2013, held in Bilbao, Spain in April 2013. The 45 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 97 initial submissions. The volume features contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). Among the topics covered are algebraic language theory; algorithms for semi-structured data mining; algorithms on automata and words; automata and logic; automata for system analysis and program verifiation; automata, concurrency and Petri nets; automatic structures; cellular automata; combinatorics on words; computability; computational complexity; computational linguistics; data and image compression; decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.); grammars and automata architectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptography; language-theoretic foundations of artificial intelligence and artifi- cial life; parallel and regulated rewriting; parsing; pattern recognition; patterns and codes; power series; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; symbolic neural networks; term rewriting; transducers; trees, tree languages and tree automata; weighted automata. |
| 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 | Computers. |
| Topical term or geographic name as entry element | Algorithms. |
| Topical term or geographic name as entry element | Computer logic. |
| Topical term or geographic name as entry element | Mathematical logic. |
| Topical term or geographic name as entry element | Artificial intelligence. |
| Topical term or geographic name as entry element | Application software. |
| 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 | Artificial Intelligence (incl. Robotics). |
| Topical term or geographic name as entry element | Logics and Meanings of Programs. |
| Topical term or geographic name as entry element | Computer Appl. in Social and Behavioral Sciences. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Dediu, Adrian-Horia. |
| Relator term | editor. |
| Personal name | Martín-Vide, Carlos. |
| Relator term | editor. |
| Personal name | Truthe, Bianca. |
| 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 | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783642370632 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| International Standard Serial Number | 0302-9743 ; |
| Volume number/sequential designation | 7810 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="http://dx.doi.org/10.1007/978-3-642-37064-9">http://dx.doi.org/10.1007/978-3-642-37064-9</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| -- | ZDB-2-LNC |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | |
No items available.