| Description |
1 online resource (xiv, 622 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 6031 |
|
LNCS sublibrary: SL 1-theoretical computer science and general issues |
|
Lecture notes in computer science ; 6031. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Invited talks: Complexity in convex languages / Janusz Brzozowski -- Three learnable models for the description of language / Alexander Clark -- Arbology : trees and pushdown automata / Bořivoj Melichar -- Analysis of communicating automata / Anca Muscholl -- Regular papers: Complexity of the satisfiability problem for a class of propositional schemata / Vincent Aravantinos, Ricardo Caferra, and Nicolas Peltier -- A simple n-dimensional intrinsically universal quantum cellular automation / Pablo Arrighi and Jonathan Grattage -- A fast longest common subsequence algorithm for similar strings / Abdullah N. Arslan -- Abelian square-free partial words / Francine Blanchet-Sadri, Jane I. Kim, Robert Merca̧s, William Severa, and Sean Simmons -- Avoidable binary patterns in partial words / Francine Blanchet-Sadri, Robert Merca̧s, Sean Simmons, and Eric Weissenstein -- Equivalence and inclusion problem for strongly unambiguous Büchi automata / Nicolas Bousquet and Christof Löding -- Pregroup grammars with letter promotions / Wojciech Buszkowski and Zhe Lin -- A hierarchical classification of first-order recurrent neural networks / Jérémie Cabessa and Alessandro E.P. Villa -- Choosing word occurrences for the smallest grammar problem / Rafael Carrascosa, François Coste, Matthias Gallé, and Gabriel Infante-Lopez -- Agreement and cliticization in Italian : a pregroup analysis / Claudia Casadio -- Geometricity of binary regular languages / Jean-Marc Champarnaud, Jean-Philippe Dubernard, and Hadrien Jeanne -- On the expressive power of FO[+] / Christian Choffrut, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano -- Finding consistent categorial grammars of bounded value : a parameterized approach / Christophe Costa Florêncio and Henning Fernau -- Operator precedence and the visibly pushdown property / Stefano Crespi Reghizzi and Dino Mandrioli -- On the maximal number of cubic runs in a string / Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Waleń -- On the Hamiltonian operators for adiabatic quantum reduction of SAT / William Cruz-Santos and Guillermo Morales-Luna -- Parametric metric interval temporal logic / Barbara Di Giampaolo, Salvatore La Torre, and Margherita Napoli -- Short witnesses and accepting lassos in omega-automata / Rüdiger Ehlers -- Grammar-based compression in a streaming model / Travis Gagie and Pawel Gawrychowski -- Simplifying regular expressions : a quantitative perspective / Hermann Gruber and Stefan Gulan -- A programming language tailored to the specification and solution of differential equations describing processes on networks / Reinhard Hemmerling, Katarína Smoleňová, and Winfried Kurth -- The inclusion problem for regular expressions / Dag Hovland -- Learnability of automatic classes / Sanjay Jain, Qinglong Luo, and Frank Stephan -- Untestable properties expressible with four first-order quantifiers / Charles Jordan and Thomas Zeugmann -- The copying power of well-nested multiple context-free grammars / Makoto Kanazawa and Sylvain Salvati -- Post correspondence problem with partially commutative alphabets / Barbara Klunder and Wojciech Rytter -- Reversible pushdown automata / Martin Kutrib and Andreas Malcher -- String extension learning using lattices / Anna Kasprzik and Timo Kötzing -- The equivalence problem of deterministic multitape finite automata : a new proof of solvability using a multidimensional tape / Alexander A. Letichevsky, Arsen S. Shoukourian, and Samvel K. Shoukourian -- Primitive words are unavoidable for context-free languages / Peter Leupold -- Modal Nonassociative Lambek Calculus with assumptions : complexity and context-freeness / Zhe Lin -- Hard counting problems for partial words / Florin Manea and Cǎtǎlin Tiseanu -- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata / Tobias Marschall and Sven Rahmann -- SA-REPC : Sequence Alignment with Regular Expression Path constraint / Nimrod Milo, Tamar Pinhas, and Michal Ziv-Ukelson -- CD-systems of stateless deterministic R(1)-automata accept all rational trace languages / Benedek Nagy and Friedrich Otto -- A boundary between universality and non-universality in extended spiking neural P systems / Turlough Neary -- Using sums-of-products for non-standard reasoning / Rafael Peñaloza -- Restarting automata with structured output and functional generative description / Martin Plátek, František Mráz, and Markéta Lopatková -- A randomized Numerical Aligner (rNA) / Alberto Policriti, Alexandru I. Tomescu, and Francesco Vezzi -- Language-based comparison of Petri nets with black tokens, pure names and ordered data / Fernando Rosa-Velardo and Giorgio Delzanno -- Verifying complex continuous real-time systems with coinductive CLP(R) / Neda Saeedloei and Gopal Gupta -- Incremental building in peptide computing to solve Hamiltonian path problem / Muthiah Sakthi Balan and Parameswaran Seshan -- Variable automata over infinite alphabets / Orna Grumberg, Orna Kupferman, and Sarai Sheinvald -- Some minimality results on biresidual and biseparable automata / Hellis Tamm -- Extending stochastic context-free grammars for an application in bioinformatics / Frank Weinberg and Markus E. Nebel -- Chomsky-Schützenberger-type characterization of multiple context-free languages / Ryo Yoshinaka, Yuichi Kaji, and Hiroyuki Seki -- Complexity of guided insertion-deletion in RNA-editing / Hans Zantema |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| In |
Springer eBooks |
| Subject |
Machine theory -- Congresses
|
|
Formal languages -- Congresses
|
|
Mathematical linguistics.
|
|
Artificial intelligence.
|
|
Linguistics.
|
|
Programming languages (Electronic computers)
|
|
Artificial Intelligence
|
|
Linguistics
|
|
Programming Languages
|
|
artificial intelligence.
|
|
linguistics.
|
|
Informatique.
|
|
Programming languages (Electronic computers)
|
|
Linguistics
|
|
Artificial intelligence
|
|
Formal languages
|
|
Machine theory
|
|
Mathematical linguistics
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Horia Dediu, Adrian.
|
|
Fernau, Henning, 1965-
|
|
Martín Vide, Carlos.
|
| ISBN |
9783642130892 |
|
3642130895 |
|
