Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013, Proceedings > Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
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
Springer Berlin Heidelberg
Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013, Proceedings
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
Authors

Francine Blanchet-Sadri; Justin Lazarow

ARI Id

1674219828702_3456422

Access

Not Available Free

Pages

165-176

DOI

10.1007/978-3-642-37064-9_16

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-37064-9_16

Table of Contents of Book
Showing 1 to 20 of 52 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Complexity Dichotomy for Counting Problems
Jin-Yi Cai
1-11
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems
Kousha Etessami
12-12
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
Luke Ong
13-41
Discrete Linear Dynamical Systems
Joël Ouaknine
42-42
XML Schema Management: A Challenge for Automata Theory
Thomas Schwentick
43-43
On the Complexity of Shortest Path Problems on Discounted Cost Graphs
Rajeev Alur; Sampath Kannan; Kevin Tian; Yifei Yuan
44-55
Termination of Rule-Based Calculi for Uniform Semi-Unification
Takahito Aoto; Munehiro Iwami
56-67
Deciding WQO for Factorial Languages
Aistis Atminas; Vadim Lozin; Mikhail Moshkov
68-79
On the Construction of a Family of Automata That Are Generically Non-minimal
Parisa Babaali; Christopher Knaplund
80-91
Limited Non-determinism Hierarchy of Counter Automata
Sebastian Bala; Dariusz Jackowski
92-103
Unambiguous Automata Denoting Finitely Sequential Functions
Sebastian Bala; Artur Koniński
104-115
Duplication-Loss Genome Alignment: Complexity and Algorithm
Billel Benzaid; Riccardo Dondi; Nadia El-Mabrouk
116-127
Maximizing Entropy over Markov Processes
Fabrizio Biondi; Axel Legay; Bo Friis Nielsen; Andrzej Wąsowski
128-140
MAT Learning of Universal Automata
Johanna Björklund; Henning Fernau; Anna Kasprzik
141-152
A Graph Polynomial Approach to Primitivity
Francine Blanchet-Sadri; Michelle Bodnar; Nathan Fox; Joe Hidakatsu
153-164
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
Francine Blanchet-Sadri; Justin Lazarow
165-176
Dynamic Communicating Automata and Branching High-Level MSCs
Benedikt Bollig; Aiswarya Cyriac; Loïc Hélouët; Ahmet Kara; Thomas Schwentick
177-189
Visibly Pushdown Automata: Universality and Inclusion via Antichains
Véronique Bruyère; Marc Ducobu; Olivier Gauwin
190-201
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne; Ludovic Mignot
202-213
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 52 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings