Nantilus
Language and automata theory and applications : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013 proceedings
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...
Enregistré dans:
| Auteurs principaux : | , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Language and automata theory and applications : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013 : proceedings / edited by Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2013 Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Sujets : | |
| Documents associés : | Autre format:
Language and Automata Theory and Applications Autre format: Language and Automata Theory and Applications |
| LEADER | 11131clm a2200733 4500 | ||
|---|---|---|---|
| 001 | PPN169139921 | ||
| 003 | http://www.sudoc.fr/169139921 | ||
| 005 | 20241001155300.0 | ||
| 010 | |a 978-3-642-37064-9 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-642-37064-9 |2 DOI |
| 035 | |a (OCoLC)847121254 | ||
| 035 | |a Springer978-3-642-37064-9 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-642-37064-9 | ||
| 035 | |a Springer-11645-978-3-642-37064-9 | ||
| 100 | |a 20130507d2013 u u0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a DE | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Language and automata theory and applications |e 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013 |e proceedings |f edited by Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe | |
| 214 | 0 | |a Berlin, Heidelberg |c Springer Berlin Heidelberg | |
| 214 | 2 | |a Cham |c Springer Nature |d 2013 | |
| 225 | 0 | |a Theoretical Computer Science and General Issues |x 2512-2029 |v 7810 | |
| 330 | |a 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. | ||
| 359 | 1 | |a 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 p-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 HedgeAutomata.- 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 andBranching 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 p-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 MachineDistance Hierarchy. | |
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |0 200114832 |t Theoretical computer science and general issues (Online) |x 2512-2029 | |
| 452 | | | |t Language and Automata Theory and Applications |b Texte imprimé |y 9783642370632 | |
| 452 | | | |t Language and Automata Theory and Applications |b Texte imprimé |y 9783642370656 | |
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Artificial Intelligence (incl. Robotics) | |
| 610 | 2 | |a Computation by Abstract Devices | |
| 610 | 2 | |a Mathematical Logic and Formal Languages | |
| 610 | 2 | |a Algorithm Analysis and Problem Complexity | |
| 610 | 2 | |a Logics and Meanings of Programs | |
| 610 | 2 | |a Computer Appl. in Social and Behavioral Sciences | |
| 610 | 2 | |a Artificial Intelligence. | |
| 610 | 2 | |a Formal Languages and Automata Theory | |
| 610 | 2 | |a Algorithms | |
| 610 | 1 | |a Theory of Computation | |
| 610 | 2 | |a Computer Science Logic and Foundations of Programming | |
| 610 | 2 | |a Computer Application in Social and Behavioral Sciences | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 676 | |a 004.0151 |v 23 | ||
| 680 | |a QA75.5-76.95 | ||
| 701 | 1 | |a Dediu |b Adrian-Horia |4 651 | |
| 701 | 1 | |3 PPN030635101 |a Martín Vide |b Carlos |f 1955-.... |4 651 | |
| 701 | 1 | |a Truthe |b Bianca |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20240814 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20240603 |g AACR2 | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-37064-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-2KJQDLS8-J |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 441099901:830857877 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-37064-9 | |
| 915 | |5 441099901:830857877 |b SPRING13-00806 | ||
| 930 | |5 441099901:830857877 |b 441099901 |j g | ||
| 991 | |5 441099901:830857877 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:14 | ||
| 997 | |a NUM |b SPRING13-00806 |d NUMpivo |e EM |s d | ||
| 998 | |a 978638 | ||