Computing maximal error-detecting capabilities and distances of regular languages

DOI10.3233/FI-2010-287MaRDI QIDQ3008089zbMATH OpenOpenAlexFDO

Authors Stavros Konstantinidis, Pedro V. Silva

Publication date 14 June 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-287

zbMATH Keywords

algorithmautomatoncombinatorial channeledit stringerror detectionmaximalregular languagestring distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Maximal error-detecting capabilities of formal languages
• Error-correction, and finite-delay decodability
• Error-detecting properties of languages
• Language equations, maximality and error-detection
• Descriptional complexity of error detection

Cited in

(11)

• Error-detecting properties of languages
• Efficient algorithms for computing the inner edit distance of a regular language via transducers
• Language equations, maximality and error-detection
• An algebra of discrete channels that involve combinations of three basic error types
• Prefix distance between regular languages
• State complexity of neighbourhoods and approximate pattern matching
• State complexity of neighbourhoods and approximate pattern matching
• Descriptional complexity of error detection
• scientific article; zbMATH DE number 2201366 (Why is no real title available?)
• Error-correction, and finite-delay decodability
• Maximal error-detecting capabilities of formal languages

This page was built for publication: Computing maximal error-detecting capabilities and distances of regular languages

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