Compact recognizers of episode sequences

DOI10.1006/inco.2002.3143zbMath1009.68068OpenAlexW2054624312MaRDI QIDQ1854526

Alberto Apostolico, Mikhail J. Atallah

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/1391

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Avoiding cross-bifix-free binary words ⋮ Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern ⋮ An inexact-suffix-tree-based algorithm for detecting extensible patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest automaton recognizing the subwords of a text
• The longest common subsequence problem revisited
• Searching subsequences
• A priority queue in which initialization and queue operations takeO(loglogD) time

This page was built for publication: Compact recognizers of episode sequences