Maximal error-detecting capabilities of formal languages

DOI10.25596/JALC-2008-055MaRDI QIDQ5503440zbMATH OpenFDO

Authors Stavros Konstantinidis, Pedro V. Silva

Publication date 15 January 2009

Full work available at URL https://doi.org/10.25596/JALC-2008-055

zbMATH Keywords

channel modelerror detectionregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Channel models (including quantum) in information and communication theory (94A40) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Computing maximal error-detecting capabilities and distances of regular languages
• Error-detecting properties of languages
• Error-correction, and finite-delay decodability
• Language equations, maximality and error-detection
• Error correction for channels with substitutions, insertions, and deletions

Cited in

(11)

• Error-detecting properties of languages
• Language equations, maximality and error-detection
• Computing maximal error-detecting capabilities and distances of regular languages
• State complexity of neighbourhoods and approximate pattern matching
• State complexity of neighbourhoods and approximate pattern matching
• Descriptional complexity of error detection
• Randomized generation of error control codes with automata and transducers
• scientific article; zbMATH DE number 2201366 (Why is no real title available?)
• Error-correction, and finite-delay decodability
• Recoverable formal language
• Automatic error correction in flexion languages

This page was built for publication: Maximal error-detecting capabilities of formal languages

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