Languages with mismatches

DOI10.1016/J.TCS.2007.06.006MaRDI QIDQ2456367zbMATH OpenOpenAlexFDO

Authors C. Epifanio, A. Gabriele, Filippo Mignosi, Antonio Restivo, M. Sciortino

Publication date 18 October 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.06.006

zbMATH Keywords

combinatorics on wordsformal languagesindexingapproximate string matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Developments in Language Theory
• Languages for imperfect information
• Mixed languages
• Languages of similarity
• Inconsistency in natural languages
• Recognizing Shuffled Languages
• Languages under concatenation and shuffling
• Languages and Grammar

Cites work

• scientific article; zbMATH DE number 1670652 (Why is no real title available?)
• scientific article; zbMATH DE number 2086228 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 2011852 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2119724 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 5263622 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• Combinatorial Pattern Matching
• Combinatorial Pattern Matching
• Developments in Language Theory
• Dictionary matching and indexing with errors and don't cares
• Forbidden Factors and Fragment Assembly
• Jewels of Stringology
• Special issue: Average-case analysis of algorithms
• Text Indexing and Dictionary Matching with One Error
• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
• Word assembly through minimal forbidden words
• Words and forbidden factors
• Words and special factors
• Words, univalent factors, and boxes

Cited in

(8)

• Dictionary-symbolwise flexible parsing
• On the Suffix Automaton with Mismatches
• Fast index for approximate string matching
• Streaming dictionary matching with mismatches
• From Nerode's congruence to suffix automata with mismatches
• Regularity of a dynamic neighborhood of a regular language
• Density of \(k\)-ary words with 0, 1, 2-error overlaps
• Developments in Language Theory

This page was built for publication: Languages with mismatches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456367)