Language and Automata Theory and Applications 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings
This book constitutes the refereed proceedings of the 10th InternationalConference on Language and Automata Theory and Applications, LATA 2016, held inPrague, Czech Republic, in March 2016.The 42 revised full papers presented together with 5 invited talks werecarefully reviewed and selected from 119...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Netherlands
Springer Nature
2016
Springer International Publishing AG Springer |
| Edition | 1 |
| Series | LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | This book constitutes the refereed proceedings of the 10th InternationalConference on Language and Automata Theory and Applications, LATA 2016, held inPrague, Czech Republic, in March 2016.The 42 revised full papers presented together with 5 invited talks werecarefully reviewed and selected from 119 submissions. The papers cover thefollowing topics: algebraic language theory; algorithms for semi-structureddata mining, algorithms on automata and words; automata and logic; automata forsystem analysis and program verification; automata networks, concurrency andPetri nets; automatic structures; cellular automata, codes, combinatorics onwords; computational complexity; data and image compression; descriptionalcomplexity; digital libraries and document engineering; foundations of finitestate technology; foundations of XML; fuzzy and rough languages; grammaticalinference and algorithmic learning; graphs and graph transformation; languagevarieties and semigroups; parallel and regulated rewriting; parsing; patterns;string and combinatorial issues in computational biology and bioinformatics;string processing algorithms; symbolic dynamics; term rewriting; transducers;trees, tree languages and tree automata; weighted automata. |
|---|---|
| AbstractList | This book constitutes the refereed proceedings of the 10th InternationalConference on Language and Automata Theory and Applications, LATA 2016, held inPrague, Czech Republic, in March 2016.The 42 revised full papers presented together with 5 invited talks werecarefully reviewed and selected from 119 submissions. The papers cover thefollowing topics: algebraic language theory; algorithms for semi-structureddata mining, algorithms on automata and words; automata and logic; automata forsystem analysis and program verification; automata networks, concurrency andPetri nets; automatic structures; cellular automata, codes, combinatorics onwords; computational complexity; data and image compression; descriptionalcomplexity; digital libraries and document engineering; foundations of finitestate technology; foundations of XML; fuzzy and rough languages; grammaticalinference and algorithmic learning; graphs and graph transformation; languagevarieties and semigroups; parallel and regulated rewriting; parsing; patterns;string and combinatorial issues in computational biology and bioinformatics;string processing algorithms; symbolic dynamics; term rewriting; transducers;trees, tree languages and tree automata; weighted automata. |
| Author | Dediu, Adrian-Horia Martín-Vide, Carlos Janousek, Jan Truthe, Bianca |
| Author_xml | – sequence: 1 fullname: Dediu, Adrian-Horia – sequence: 2 fullname: Janousek, Jan – sequence: 3 fullname: Martín-Vide, Carlos – sequence: 4 fullname: Truthe, Bianca |
| BookMark | eNpdj0tPwzAQhI14CFryHyouiEMkrx079rFULSBV4lJxjTap86CpHeIExL_HEC6wl90ZfZrRzsiZddackEininPQnIbRp__0BZkBlRK0Ujy9JJH3r8EGKTRQdkXiLdpqxMos0O4Xy3FwRxxwsauN6z8nr-vapsChcdZfk_MSW2-i3z0nL5v1bvUYb58fnlbLbYwsVYmMOYSGAlkpg2IAXMpcKs1B5kqEgxWlSlBJoMgVTyQVAWLcUFbSPQDlc3I3BaM_mA9fu3bw2XtrcucOPvvzYGBvJ7br3dto_JD9YIWxQ49ttr5fCaEZTb7Jm4ks0GPb2CY7OuuqHrvaZyIBoVLJvwC4dl2M |
| ContentType | eBook |
| DBID | I4C |
| DEWEY | 006 |
| DatabaseName | Torrossa Single Purchase Catalogue |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISBN | 9783319300009 3319300008 |
| Edition | 1 1st ed. 2016 |
| Editor | Dediu, Adrian-Horia Mart'n-Vide, Carlos Janou'ek, Jan Truthe, Bianca |
| Editor_xml | – sequence: 1 fullname: Dediu, Adrian-Horia – sequence: 2 fullname: Janou'ek, Jan – sequence: 3 fullname: Mart'n-Vide, Carlos – sequence: 4 fullname: Truthe, Bianca |
| ExternalDocumentID | 9783319300009 EBC5592049 5415876 |
| GroupedDBID | 0D6 0DA 38. AABBV AAMCO AAPIT AAQZU ABBVZ ABMNI ABOWU ACLMJ ADCXD ADPGQ AEDXK AEJGN AEKFX AETDV AEZAY ALMA_UNASSIGNED_HOLDINGS AORVH AZZ BBABE CZZ I4C IEZ LDH NUC SAO SBO SWNTM TPJZQ TSXQS Z5O Z7R Z7S Z7U Z7V Z7W Z7X Z7Y Z7Z Z81 Z82 Z83 Z84 Z85 Z87 Z88 AEJLV |
| ID | FETCH-LOGICAL-a27846-31016ca2f6846211366b689316b856892cf84a8610a383460521123e02f0d1103 |
| ISBN | 9783319300009 3319300008 9783319299990 3319299999 |
| IngestDate | Wed Jan 31 08:29:55 EST 2024 Tue Mar 26 00:16:29 EDT 2024 Tue Nov 14 22:50:57 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a27846-31016ca2f6846211366b689316b856892cf84a8610a383460521123e02f0d1103 |
| OCLC | 1066198837 |
| PQID | EBC5592049 |
| PageCount | 618 |
| ParticipantIDs | askewsholts_vlebooks_9783319300009 proquest_ebookcentral_EBC5592049 casalini_monographs_5415876 |
| PublicationCentury | 2000 |
| PublicationDate | 2016 2016-02-29 |
| PublicationDateYYYYMMDD | 2016-01-01 2016-02-29 |
| PublicationDate_xml | – year: 2016 text: 2016 |
| PublicationDecade | 2010 |
| PublicationPlace | Netherlands |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesTitle | LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| PublicationYear | 2016 |
| Publisher | Springer Nature Springer International Publishing AG Springer |
| Publisher_xml | – name: Springer Nature – name: Springer International Publishing AG – name: Springer |
| SSID | ssj0001659102 |
| Score | 2.0156167 |
| Snippet | This book constitutes the refereed proceedings of the 10th InternationalConference on Language and Automata Theory and Applications, LATA 2016, held inPrague,... |
| SourceID | askewsholts proquest casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Machine theory Machine theory-Congresses Mathematical linguistics Special computer methods |
| Subtitle | 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings |
| TableOfContents | 3 Dense-Time Visibly Pushdown Automata (dtVPA) -- 4 Emptiness and Determinizability -- 5 Logical Characterization of dtVPA -- References -- A Complexity Measure on Büchi Automata -- 1 Introduction -- 2 Preliminaries -- 3 A Complexity Measure on NBAs -- 4 From NBk to DMk' -- 5 From DMk+ to NBk' -- References -- Compositional Bisimulation Minimization for Interval Markov Decision Processes -- 1 Introduction -- 2 Preliminaries -- 2.1 Interval Markov Decision Processes -- 2.2 Probabilistic Computation Tree Logic (PCTL) -- 3 Probabilistic Bisimulation for Interval MDPs -- 3.1 Compositional Reasoning -- 4 Hardness and Tractability -- 4.1 Decision Algorithm -- 5 Concluding Remarks -- References -- A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem -- 1 Introduction -- 2 Preliminaries -- 3 Weighted Automata with Storage -- 4 Weighted Logic with Storage Behaviour -- 5 Results -- References -- Automata and Words -- Colored Nested Words -- 1 Introduction -- 2 Colored Nested Words -- 3 Regularity -- 4 Colored Nested Word Automata -- 5 Equivalent Models -- 6 Closure Properties and Decision Problems -- 7 Grammar Characterization -- References -- Input-Driven Queue Automata with Internal Transductions -- 1 Introduction -- 2 Preliminaries -- 3 Closure Properties -- 4 Determinization -- 5 Decidability Questions -- References -- Periodic Generalized Automata over the Reals -- 1 Introduction -- 2 Periodic GKL Automata -- 3 Decidability -- 4 Structural Results -- 5 Further Questions -- References -- Minimal Separating Sequences for All Pairs of States -- 1 Introduction -- 2 Preliminaries -- 2.1 Partition Refinement -- 2.2 Splitting Trees and Refinable Partitions -- 3 Minimal Separating Sequences -- 4 Optimizing the Algorithm -- 5 Application in Conformance Testing -- 6 Experimental Results -- 7 Conclusion -- References Forkable Regular Expressions -- 1 Introduction -- 2 Preliminaries -- 3 Behaviors -- 4 Derivatives -- 5 Well-Behaved Behaviors -- 6 Related Work -- References -- On the Levenshtein Automaton and the Size of the Neighbourhood of a Word -- 1 Introduction -- 2 Definition and Construction of the Deterministic Universal Levenshtein Automaton -- 2.1 Preliminaries and Notations -- 2.2 Bit Vector Representation -- 2.3 Construction of the Nondeterministic Universal Levenshtein Automaton -- 2.4 Construction of the Deterministic Universal Levenshtein Automaton -- 3 Application to the Neighbourhood Counting Problem -- 3.1 A DFA for Encod(P,k) -- 3.2 Back to the Counting Problem -- 4 Conclusion -- References -- Combinatorics on Words -- Parallelogram Morphisms and Circular Codes -- 1 Introduction -- 2 Words and Codes -- 3 Discrete Paths and Graphs -- 4 Parallelogram Networks -- 5 Main Result -- 6 Concluding Remarks -- References -- On Del-Robust Primitive Partial Words with One Hole -- 1 Introduction -- 2 Preliminaries -- 3 Del-Robust Primitive Partial Words with One Hole -- 4 Context-Freeness of Qp 1D -- 5 Counting n-Length Words in Qp1D -- 6 Conclusions -- References -- Optimal Bounds for Computing -gapped Repeats -- 1 Introduction -- 2 Number of Maximal Repeats and Subrepetitions -- 3 Computing All Maximal -gapped Repeats -- 4 Concluding Remarks -- References -- Complexity -- On XOR Lemma for Polynomial Threshold Weight and Length -- 1 Introduction -- 2 Preliminaries -- 3 Upper Bounds on the Length of XOR of ANDs -- 4 The XOR Lemma for PTF Weight -- 5 Concluding Remarks -- References -- The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line -- 1 Introduction -- 1.1 Related Work -- 1.2 Outline of the Paper -- 2 Preliminaries -- 2.1 Starting from an Endpoint -- 2.2 Starting from an Inner Point Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Reconstructing Preferences from Opaque Transactions -- Non-Zero Sum Games for Reactive Synthesis -- Tangles and Connectivity in Graphs -- Restricted Turing Machines and Language Recognition -- Automata for Ontologies -- Contents -- Invited Talks -- Non-Zero Sum Games for Reactive Synthesis -- 1 Introduction -- 2 Preliminaries -- 3 Classical Zero-Sum Setting -- 4 Assume Admissible Synthesis -- 5 Regret Minimization -- 6 Game Arenas with Expected Adversary -- References -- Tangles and Connectivity in Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Tangles in a Graph -- 4 Tangles and Components -- 4.1 Biconnected and Triconnected Components -- 4.2 From Components to Tangles -- 4.3 From Tangles to Components -- 5 A Broader Perspective: Tangles and Connectivity Systems -- 5.1 Tangles -- 6 Decompositions and Duality -- References -- Restricted Turing Machines and Language Recognition -- 1 Introduction -- 2 Fast One-Tape Turing Machines -- 3 One-Tape Turing Machines with Rewriting Restrictions -- 4 Final Remarks -- References -- Automata for Ontologies -- References -- Automata and Logic -- Reasoning with Prototypes in the Description Logic ALC Using Weighted Tree Automata -- 1 Introduction -- 2 Preliminaries -- 3 Prototypes and Weighted Tree Automata -- 4 Reasoning with Prototype Automata in ALC -- 5 Conclusions -- References -- +-Picture Languages Recognizable by Büchi-Tiling Systems -- 1 Introduction -- 2 Preliminaries -- 3 Büchi-Tiling Recognizable +-Picture Languages -- 4 A Logical Characterization of the Büchi-Tiling Recognizable +-Picture Languages -- 5 No Büchi Characterization Theorem For +-Picture Languages -- 6 Conclusion -- References -- A Logical Characterization for Dense-Time Visibly Pushdown Automata -- 1 Introduction -- 2 Preliminaries 3.2 Grammar Optimization by Merging Indistinguishable Variables 1 Introduction -- 2 Preliminaries -- 3 Homomorphic Characterization -- 4 Relation with Medvedev Theorem and Conclusion -- References -- Homomorphic Characterizations of Indexed Languages -- 1 Introduction -- 2 Epsilon-Reducible Context-Free Languages -- 2.1 Free Groups and Dyck Languages -- 2.2 -Reducible Context-Free Languages and Grammars -- 2.3 A Chomsky--Schützenberger-like Theorem for -CFLs -- 2.4 Related Works -- 3 Epsilon-Reducible Context-Free Transductions -- 3.1 Transductions -- 3.2 -Reducible Context-Free Transductions and Transducers -- 4 Characterizations of Indexed Languages -- 4.1 Indexed Grammars and Languages -- 4.2 Characterizations of Indexed Languages -- References -- Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy -- 1 Introduction -- 2 Preliminaries -- 2.1 Multiple Context-Free Grammars -- 2.2 The Control Language Hierarchy -- 3 The Failure of Ogden's Lemma for Well-Nested MCFGs and 2-MCFGs -- 4 A Generalized Ogden's Lemma for a Subclass of the MCFGs -- 5 Relation to the Control Language Hierarchy -- 6 Conclusion -- References -- Grammatical Inference, Algorithmic Learning, and Patterns -- Steganography Based on Pattern Languages -- 1 Introduction -- 1.1 Our Contributions -- 2 Basics and Notations -- 2.1 Steganography -- 2.2 Cryptographic Primitives -- 2.3 Pattern Languages -- 3 Steganography Using Patterns -- 3.1 Coding Bits by Random Subsets -- 3.2 Bounding the Rank of Matrices Obtained by Random Assignments of Intermediate Patterns -- 3.3 Modifying Strings of a Pattern Language to Embed Secrets -- 3.4 Sampling a Pattern Channel -- 3.5 A Secure Stegosystem for Pattern Channels -- References -- Inferring a Relax NG Schema from XML Documents -- 1 Introduction -- 2 Preliminaries -- 3 Inference of an NRHG from Trees -- 3.1 Primitive NRHG Construction 3 Searching a Line Segment Starting from an Inner Point -- 3.1 Mobile Agents Which Cannot Turn Back -- 3.2 Mobile Agents Which Can Return to the Starting Point Instantaneously -- 3.3 Mobile Agents Which Can Turn Back -- 3.4 An Algorithm for Identical Agents Which Can Turn Back -- 4 Conclusions and Open Problems -- References -- Using Duality in Circuit Complexity -- 1 Introduction -- 2 Constant Size Circuits Families -- 3 The Block Product for Varieties of Languages -- 4 Duality and the Block Product -- 5 Equations for the Block Product -- 6 Conclusion -- References -- The Minimum Entropy Submodular Set Cover Problem -- 1 Introduction -- 2 Preliminaries -- 3 Minimum Entropy Submodular Set Cover: Definition, Special Cases and Applications -- 3.1 The Greedy Algorithm -- 4 Main Result and Definition of the Covering Coefficient -- 5 Proof of Main Result -- 6 Applications: Special Cases with =1 -- 7 Network Flow Interpretation of and a Multistage Approach -- 8 Application to MEST -- 9 Conclusions and Open Problems -- References -- On the Capacity of Capacitated Automata -- 1 Introduction -- 2 Preliminaries -- 3 Closure Constructions -- 4 Decision Procedures -- 5 Conclusion and Future Work -- References -- On Limited Nondeterminism and ACC Circuit Lower Bounds -- 1 Introduction -- 2 A Consequence of the Inclusion EXP ACC0 -- 3 An Exponential Size-Depth Tradeoff for ENP[2nc] -- References -- The Complexity of Induced Tree Reconfiguration Problems -- 1 Introduction -- 2 Preliminaries -- 2.1 Graphs -- 2.2 Reconfiguration Problem -- 3 PSPACE-Completeness -- 3.1 3SAT Reconfiguration Problem -- 3.2 Polynomial-Time Reduction -- 3.3 Token Sliding Case -- 3.4 Maximal Induced Tree Reconfiguration Problem -- 4 W[1]-Hardness -- 5 Fixed Parameter Tractability -- 6 Conclusion -- References -- Grammars -- The Missing Case in Chomsky-Schützenberger Theorem |
| Title | Language and Automata Theory and Applications |
| URI | http://digital.casalini.it/9783319300009 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5592049 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319300009 |
| Volume | 9618 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwED36sdAFKCBKAUWINai1k9QdCyqqKmBApeoW2amzgFqJpAz8ep7zTUFIsESOlVjKO-fu3dl3JroaKuao_iCwGeeuDYunbCnCwAYZDnigl0OWBNweHr3JszNduIvazlNl19ImVtfBx495Jf-RKvogV5Ml-wfJFoOiA23IF1dIGNct8lvcFpnLSZQxCf2PNvEavFNmefZpX2VduurY97cd-zywZ3YtZ8VFCr-P48fhCb0r1Xixuc6FTYaOq1N9IPCfN0fj6f28jDt5LhiCcVCLQURaiKgctEUtGb1AyUIBx5Gx2DKSJlHzm8FKrPBsn5rapGYcUE2v2rSXH0hhZfqpTa1KdcVDsnOULCBi5ShZKUppXwWlI5rfjWe3Ezs7HcKWZrHUg_XAxwSShR7umDmbxlMe6FffU8JFgwWhcKQAP5Rww836Lx5iXPdY2FuC9fBjaqzWK31CFutp7kqXewMpHbnUw6QQv-ipUIQhGE2HLiuA-O-vyUp25H9BrUPdHCcfEy2tOB75mTg6ZOXQ-cnb2eZbf3xzC6-OwVM7_XWALu2Ws-SMGvHbRp-DEMXqIpPxJy2vB7E |
| link.rule.ids | 307,783,787,789 |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Language+and+Automata+Theory+and+Applications&rft.date=2016-01-01&rft.pub=Springer+Nature&rft.isbn=9783319300009&rft.externalDocID=5415876 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.askewsandholts.com%2Fuploads%2Fproduct%2Fimages%2Ffull%2F0009%2F9783319300009.jpg |