close
1.

電子ブック

EB
Adrian-Horia Dediu, Henning Fernau, Takeo Kanade, Carlos Martín-Vide
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Complexity in Convex Languages / Janusz Brzozowski
Three Learnable Models for the Description of Language / Alexander Clark
Arbology: Trees and Pushdown Automata / Borivoj Melichar
Analysis of Communicating Automata / Anca Muscholl
Regular Papers
Complexity of the Satisfiability Problem for a Class of Propositional Schemata / Vincent Aravantinos ; Ricardo Caferra ; Nicolas Peltier
A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton / Pablo Arrighi ; 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 Mercas ; William Severa ; Sean Simmons
Avoidable Binary Patterns in Partial Words / Eric Weissenstein
Equivalence and Inclusion Problem for Strongly Unambiguous Böchi Automata / Nicolas Bousquet ; Christof Löding
Pregroup Grammars with Letter Promotions / Wojciech Buszkowski ; Zhe Lin
A Hierarchical Classification of First-Order Recurrent Neural Networks / Jérémie Cabessa ; Alessandro E.P. Villa
Choosing Word Occurrences for the Smallest Grammar Problem / Rafael Carrascosa ; François Coste ; Matthias Gallé ; Gabriel Infante-Lopez
Agreement and Cliticization in Italian: A Pregroup Analysis / Claudia Casadio
Geometricity of Binary Regular Languages / Jean-Marc Champarnaud ; Jean-Philippe Dubernard ; Hadrien Jeanne
On the Expressive Power of FO[+] / Christain Choffrut ; Andreas Malcher ; Carlo Mereghetti ; Beatrice Palano
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach / Christophe Costa ; Florêncio ; Henning Fernau
Operator Precedence and the Visibly Pushdown Property / Stefano Crespi Reghizzi ; Dino Mandrioli
On the Maximal Number of Cubic Runs in a String / Maxime Crochemore ; Costas Iliopoulos ; Marcin Kubica ; Jakub Radoszewski ; Wojciech Rytter ; Tomasz Walen
On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT / William Cruz-Santos ; Guillermo Morales-Luna
Parametric Metric Interval Temporal Logic / Barbara Di Giampaolo ; Salvatore La Torre ; Margherita Napoli
Short Witnesses and Accepting Lassos in ?-Automata / Rüdiger Ehlers
Grammar-Based Compression in a Streaming Model / Travis Gagie ; Pawel Gawrychowski
Simplifying Regular Expressions: A Quantitative Perspective / Hermann Gruber ; Stefan Gulan
A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks / Reinhard Hemmerling ; Katarína Smolenová ; Winfried Kurth
The Inclusion Problem for Regular Expressions / Dag Hovland
Learnability of Automatic Classes / Sanjay Jain ; Qinglong Luo ; Frank Stephan
Untestable Properties Expressible with Four First-Order Quantifiers / Charles Jordan ; Thomas Zeugmann
The Copying Power of Well-Nested Multiple Context-Free Grammars / Makoto Kanazawa ; Sylvain Salvati
Post Correspondence Problem with Partially Commutative Alphalbets / Barbara Klunder
Reversible Pushdown Automata / Martin Kutrib
String Extension Learning Using Lattices / Anna Kasprzik ; 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 ; Samvel K. Shoukourian
Primitive Words are Unavoidable for Coutext-Free Languages / Peter Leupold
Model Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness
Hard Counting Problems for Partial Words / Florin Manea ; Catalin Tiseanu
Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata / Tobias Marschall ; Sven Rahmann
SA-REPC - Sequence Alignment with Regular Expression Path Constraint / Nimrod Milo ; Tamar Pinhas ; Michal Ziv-Ukelson
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages / Benedek Nagy ; 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 ; Markéta Lopatková
A Randomized Numerical Aligner (rNA) / Alberto Policriti ; Alexandru I. Tomescu ; Francesco Vezzi
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data / Fernando Rosa-Velardo ; Giorgio Delzanno
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) / Neda Saeedloei ; Gopal Gupta
Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem / Muthiah Sakthi Balan ; Parameswaran Seshan
Variable Automata over Infinite Alphabets / Orna Grumberg ; Orna Kupferman ; Sarai Sheinvald
Some Minimality Results on Biresidual and Biseparable Automata / Hellis Tamm
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics / Frank Weinberg ; Markus E. Nebel
Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages / Ryo Yoshinaka ; Yuichi Kaji ; Hiroyuki Seki
Complexity of Guided Insertion-Deletion in RNA-Editing / Hans Zantema
Author Index
Invited Talks
Complexity in Convex Languages / Janusz Brzozowski
Three Learnable Models for the Description of Language / Alexander Clark
2.

電子ブック

EB
Adrian-Horia Dediu, Shunsuke Inenaga, Takeo Kanade, Carlos Martín-Vide
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼