Descriptional Complexity of Error Detection
نویسندگان
چکیده
The neighbourhood of a language L consists of all strings that are within a given distance from a string of L. For example, additive distances or the prefixdistance are regularity preserving in the sense that the neighbourhood of a regular language is always regular. For error detection and error correction applications an important question is to determine the size of the minimal deterministic finite automaton (DFA) needed to recognize the neighbourhood of a language recognized by an n state DFA. This paper surveys recent work on the state complexity of neighbourhoods of regularity preserving distances.
منابع مشابه
Descriptional Complexity of Generalized Forbidding Grammars
This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.
متن کاملDescriptional Complexity of Machines with Limited Resources
Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of different contexts, our goal here is to provide a survey of these results. Particular emphasis is put on limiting resources (e.g., nondeterminism, ambiguity, lookahead, etc.) for various types of finite state machines, push...
متن کاملDescriptional Complexity of Deterministic Regular Expressions
We study the descriptional complexity of regular languages that are definable by deterministic regular expressions. First, we examine possible blow-ups when translating between regular expressions, deterministic regular expressions, and deterministic automata. Then we give an overview of the closure properties of these languages under various language-theoretic operations and we study the descr...
متن کاملThe error-bounded descriptional complexity of approximation networks
It is well known that artificial neural nets can be used as approximators of any continuous functions to any desired degree and therefore be used e.g. in high speed, real-time process control. Nevertheless, for a given application and a given network architecture the non-trivial task remains to determine the necessary number of neurons and the necessary accuracy (number of bits) per weight for ...
متن کامل