Maximal error-detecting capabilities of formal languages

Authors:
Stavros Konstantinidis;Pedro V. Silva
Affiliations:
Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, Canada;Centro de Matemática, Faculdade de Ciências, Universidade do Porto, Porto, Portugal
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2008

Citing 6
Cited 2

Decoders with initial state invariance for multivalued encodings

Theoretical Computer Science
Coding and information theory

Coding and information theory
Thin and slender languages

Discrete Applied Mathematics
Regular languages

Handbook of formal languages, vol. 1
Handbook of Formal Languages

Handbook of Formal Languages
Descriptional complexity of error/edit systems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems

Computing Maximal Error-detecting Capabilities and Distances of Regular Languages

Fundamenta Informaticae
Automata for codes

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

A (combinatorial) channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability" of a given language, with respect to a certain class of channels, which is simply a maximal channel for which the given language is error-detecting. The new concept is intended to address formally the question of "finding the largest amount of errors that a language can detect". We focus on rational channels (those described by finite transducers) and on regular languages, and consider the problem of computing maximal error-detecting capabilities of a given regular language for various classes of rational channels. We also discuss briefly the concept "maximal error-correcting capability" of a formal language.