Languages with mismatches

DOI10.1016/J.TCS.2007.06.006zbMATH Open1124.68088OpenAlexW2063649331MaRDI QIDQ2456367FDOQ2456367

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

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

zbMATH Keywords

combinatorics on wordsformal languagesindexingapproximate string matching

Mathematics Subject Classification ID

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

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dictionary matching and indexing with errors and don't cares
• Title not available (Why is that?)
• Title not available (Why is that?)
• Text Indexing and Dictionary Matching with One Error
• Special issue: Average-case analysis of algorithms
• Jewels of Stringology
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Words and forbidden factors
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
• Word assembly through minimal forbidden words
• Developments in Language Theory
• Words and special factors
• Forbidden Factors and Fragment Assembly
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial Pattern Matching
• Combinatorial Pattern Matching
• 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)