Computing Maximal Error-detecting Capabilities and Distances of Regular Languages

DOI10.3233/FI-2010-287zbMath1216.94040OpenAlexW1722516136MaRDI QIDQ3008089

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

algorithmregular languageerror detectionautomatonmaximalcombinatorial channelstring distanceedit string

Mathematics Subject Classification ID

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

Related Items (5)

State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ Descriptional Complexity of Error Detection ⋮ Prefix Distance Between Regular Languages

This page was built for publication: Computing Maximal Error-detecting Capabilities and Distances of Regular Languages