What is a maximal error-detecting capability of a formal language?

Authors:
Stavros Konstantinidis
Affiliations:
Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, Canada
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 4
Cited 0

Coding and information theory

Coding and information theory
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Regular languages

Handbook of formal languages, vol. 1
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concepts "maximal error-correcting capability" and "maximal error-detecting capability" of a given formal language (set of words), with respect to a certain class of combinatorial channels. A combinatorial channel is a set of pairs of words describing all the possible input/output channel situations. This paper is mainly intended to obtain basic general results on these new concepts and discuss possible research directions with an emphasis on the problem of computing maximal error-detecting (or-correcting) capabilities of a given regular language.