Staff View for: Language and automata theory and applica

 Staff view

You must be logged in to Tag Records

Language and automata theory and applications : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings /

Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe (eds.).

Book Cover
Names: Horia Dediu, Adrian. | Martín Vide, Carlos. | Truthe, Bianca.
Vernacular: Revealing vs. Concealing: More Simulation Games for Büchi Inclusion / Milka Hutagalung, Martin Lange, Etienne Lozes -- On Bounded Languages and Reversal-Bounded Automata / Oscar H. Ibarra, Bala Ravikumar -- Rewrite Closure and CF Hedge Automata / Florent Jacquemard, Michael Rusinowitch -- Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing / Tomasz Kociumaka [and others]́ -- From Regular Tree Expression to Position Tree Automaton / Éric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi -- Convergence of Newton's Method over Commutative Semirings / Michael Luttenberger, Maximilian Schlund -- Counting Minimal Symmetric Difference NFAs / Brink van der Merwe, Mark Farag, Jaco Geldenhuys -- Interval Logics and ωB-Regular Languages / Angelo Montanari, Pietro Sala -- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars / Katsuhiko Nakamura, Keita Imada.
Asynchronous PC Systems of Pushdown Automata / Friedrich Otto -- Model Checking Metric Temporal Logic over Automata with One Counter / Karin Quaas -- Coinductive Proof Techniques for Language Equivalence / Jurriaan Rot, Marcello Bonsangue, Jan Rutten -- Ostrowski Numeration and the Local Period of Sturmian Words / Luke Schaeffer -- Boolean Algebras of Regular ω-Languages / Victor Selivanov, Anton Konovalov -- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars / Eli Shamir -- Online Matching of Multiple Regular Patterns with Gaps and Character Classes / Seppo Sippu, Eljas Soisalon-Soininen -- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems / Tim Smith -- Uniformisation of Two-Way Transducers / Rodrigo de Souza -- A Conditional Superpolynomial Lower Bound for Extended Resolution / Olga Tveretina -- A Turing Machine Distance Hierarchy / Stanislav Žák, Jiří Šíma.
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks / Giorgio Delzanno, Riccardo Traverso -- The Buffered π-Calculus: A Model for Concurrent Languages / Xiaojie Deng [and others] -- Mix-Automatic Sequences / Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks -- A Multivariate Analysis of Some DFA Problems / Henning Fernau, Pinar Heggernes, Yngve Villanger -- On the Size Complexity of Deterministic Frequency Automata / Rūsiņš Freivalds, Thomas Zeugmann, Grant R. Pogosyan -- On the Number of Unbordered Factors / Daniel Goč, Hamoon Mousavi, Jeffrey Shallit -- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences / Daniel Goč, Kalle Saari, Jeffrey Shallit -- Efficient Submatch Extraction for Practical Regular Expressions / Stuart Haber [and others] -- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers / Kenji Hashimoto [and others].
Published: Berlin ; Springer, ©2013.
Series: Lecture notes in computer science ; 7810.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Topics: Machine theory - Congresses. | Formal languages - Congresses. | Mathematical linguistics - Congresses. | Artificial Intelligence. | Programming Languages. | Linguistics. | Mathematics.
Genres: Electronic books. | Congress. | Conference papers and proceedings. | Computer software.
Tags: Add


Spaces will separate tags.
Use quotes for multi-word tags.


000 10004cam a2200769Ii 4500
001 13447061
005 20190928192201.0
006 m o d
007 cr cn|||||||||
008 130402s2013 gw a o 101 0 eng d
016 7 |a016326415|2Uk
020 |a9783642370649|q(electronic bk.)
020 |a3642370640|q(electronic bk.)
020 |z9783642370632
024 7 |a10.1007/978-3-642-37064-9|2doi
035 |a(OCoLC)ocn834574130
035 |a(UIUdb)9132858
040 |aGW5XE|beng|erda|epn|cGW5XE|dYDXCP|dZMC|dCOO|dSNK|dOHS|dOCLCO|dOCLCF|dUKMGB|dVLB|dOCLCO|dOCL|dOCLCO|dOCLCQ|dOCLCO|dEBLCP|dOCLCQ|dOCLCO|dDGU|dESU|dIOG|dNJR|dOCLCO|dOCLCA|dBUF|dOCLCO|dMERER|dOCLCO|dOCLCQ|dCEF|dOCLCQ|dU3W|dAU@|dOCLCO|dWYU|dYOU|dTKN|dOCLCQ|dOCLCO|dOCLCQ|dUIU|dUIUdb
049 |aUIUU|oskip
050 4|aQA267|b.L38 2013
060 4|aQA 267
082 04|a004|223
111 2 |aLATA (Conference)|n(7th :|d2013 :|cBilbao, Spain)
245 10|aLanguage and automata theory and applications :|b7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings /|cAdrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe (eds.).
246 30|aLATA 2013
260 |aBerlin ;|aNew York :|bSpringer,|c©2013.
300 |a1 online resource (xiv, 580 pages) :|billustrations
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
347 |aimage files|dPNG|2rda
490 1 |aLecture notes in computer science,|x0302-9743 ;|v7810
490 1 |aLNCS sublibrary. SL 1, Theoretical computer science and general issues
500 |aInternational conference proceedings.
500 |aIncludes author index.
505 00|6880-01|tInvited Talks.|tComplexity Dichotomy for Counting Problems /|rJin-Yi Cai --|tAlgorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems /|rKousha Etessami --|tRecursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking /|rLuke Ong --|tDiscrete Linear Dynamical Systems /|rJoël Ouaknine --|tXML Schema Management: A Challenge for Automata Theory /|rThomas Schwentick --|tRegular Papers.|tOn the Complexity of Shortest Path Problems on Discounted Cost Graphs /|rRajeev Alur [and others] --|tTermination of Rule-Based Calculi for Uniform Semi-Unification /|rTakahito Aoto, Munehiro Iwami --|tDeciding WQO for Factorial Languages /|rAistis Atminas, Vadim Lozin, Mikhail Moshkov --|tOn the Construction of a Family of Automata That Are Generically Non-minimal /|rParisa Babaali, Christopher Knaplund --|tLimited Non-determinism Hierarchy of Counter Automata /|rSebastian Bala, Dariusz Jackowski --|tUnambiguous Automata Denoting Finitely Sequential Functions /|rSebastian Bala, Artur Koniński.
505 80|tDuplication-Loss Genome Alignment: Complexity and Algorithm /|rBillel Benzaid, Riccardo Dondi, Nadia El-Mabrouk --|tMaximizing Entropy over Markov Processes /|rFabrizio Biondi [and others] --|tMAT Learning of Universal Automata /|rJohanna Björklund, Henning Fernau, Anna Kasprzik --|tA Graph Polynomial Approach to Primitivity /|rFrancine Blanchet-Sadri [and others] --|tSuffix Trees for Partial Words and the Longest Common Compatible Prefix Problem /|rFrancine Blanchet-Sadri, Justin Lazarow --|tDynamic Communicating Automata and Branching High-Level MSCs /|rBenedikt Bollig [and others] --|tVisibly Pushdown Automata: Universality and Inclusion via Antichains /|rVéronique Bruyère, Marc Ducobu, Olivier Gauwin --|tTwo-Sided Derivatives for Regular Expressions and for Hairpin Expressions /|rJean-Marc Champarnaud [and others] --|tHow to Travel between Languages /|rKrishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin --|tExecution Information Rate for Some Classes of Automata /|rCewei Cui [and others].
520 |aThis 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.
588 0 |aPrint version record.
650 0|aMachine theory|vCongresses.
650 0|aFormal languages|vCongresses.
650 0|aMathematical linguistics|vCongresses.
650 7|aFormal languages.|2fast|0(OCoLC)fst00932922
650 7|aMachine theory.|2fast|0(OCoLC)fst01004846
650 7|aMathematical linguistics.|2fast|0(OCoLC)fst01012082
650 2|aArtificial Intelligence.|0(DNLM)D001185
650 2|aProgramming Languages.|0(DNLM)D011381
650 2|aLinguistics.|0(DNLM)D008037
650 2|aMathematics.|0(DNLM)D008433
655 4|aElectronic books.
655 2|aCongress.|0(DNLM)D016423
655 7|aConference papers and proceedings.|2fast|0(OCoLC)fst01423772
655 7|aComputer software.|2lcgft
700 1 |aHoria Dediu, Adrian.
700 1 |aMartín Vide, Carlos.
700 1 |aTruthe, Bianca.
776 08|iPrint version:|z9783642370632
830 0|aLecture notes in computer science ;|v7810.
830 0|aLNCS sublibrary.|nSL 1,|pTheoretical computer science and general issues.
852 8 |beresour-nc|hOnline Resource|t1|zAccessible anywhere on campus or with UIUC NetID
856 40|3SpringerLink - Full text online|uhttp://www.library.illinois.edu/proxy/go.php?url=https://doi.org/10.1007/978-3-642-37064-9
880 80|6505-00|tRevealing vs. Concealing: More Simulation Games for Büchi Inclusion /|rMilka Hutagalung, Martin Lange, Etienne Lozes --|tOn Bounded Languages and Reversal-Bounded Automata /|rOscar H. Ibarra, Bala Ravikumar --|tRewrite Closure and CF Hedge Automata /|rFlorent Jacquemard, Michael Rusinowitch --|tLinear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing /|rTomasz Kociumaka [and others]́ --|tFrom Regular Tree Expression to Position Tree Automaton /|rÉric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi --|tConvergence of Newton's Method over Commutative Semirings /|rMichael Luttenberger, Maximilian Schlund --|tCounting Minimal Symmetric Difference NFAs /|rBrink van der Merwe, Mark Farag, Jaco Geldenhuys --|tInterval Logics and ωB-Regular Languages /|rAngelo Montanari, Pietro Sala --|tEliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars /|rKatsuhiko Nakamura, Keita Imada.
880 80|6505-00|tAsynchronous PC Systems of Pushdown Automata /|rFriedrich Otto --|tModel Checking Metric Temporal Logic over Automata with One Counter /|rKarin Quaas --|tCoinductive Proof Techniques for Language Equivalence /|rJurriaan Rot, Marcello Bonsangue, Jan Rutten --|tOstrowski Numeration and the Local Period of Sturmian Words /|rLuke Schaeffer --|tBoolean Algebras of Regular ω-Languages /|rVictor Selivanov, Anton Konovalov --|tPumping, Shrinking and Pronouns: From Context Free to Indexed Grammars /|rEli Shamir --|tOnline Matching of Multiple Regular Patterns with Gaps and Character Classes /|rSeppo Sippu, Eljas Soisalon-Soininen --|tInfiniteness and Boundedness in 0L, DT0L, and T0L Systems /|rTim Smith --|tUniformisation of Two-Way Transducers /|rRodrigo de Souza --|tA Conditional Superpolynomial Lower Bound for Extended Resolution /|rOlga Tveretina --|tA Turing Machine Distance Hierarchy /|rStanislav Žák, Jiří Šíma.
880 80|6505-01|tDecidability and Complexity Results for Verification of Asynchronous Broadcast Networks /|rGiorgio Delzanno, Riccardo Traverso --|tThe Buffered π-Calculus: A Model for Concurrent Languages /|rXiaojie Deng [and others] --|tMix-Automatic Sequences /|rJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks --|tA Multivariate Analysis of Some DFA Problems /|rHenning Fernau, Pinar Heggernes, Yngve Villanger --|tOn the Size Complexity of Deterministic Frequency Automata /|rRūsiņš Freivalds, Thomas Zeugmann, Grant R. Pogosyan --|tOn the Number of Unbordered Factors /|rDaniel Goč, Hamoon Mousavi, Jeffrey Shallit --|tPrimitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences /|rDaniel Goč, Kalle Saari, Jeffrey Shallit --|tEfficient Submatch Extraction for Practical Regular Expressions /|rStuart Haber [and others] --|tDeterminacy and Subsumption for Single-Valued Bottom-Up Tree Transducers /|rKenji Hashimoto [and others].
938 |aEBL - Ebook Library|bEBLB|nEBL3093379
938 |aYBP Library Services|bYANK|n10436247
994 |aC0|bUIU

Staff View for: Language and automata theory and applica