Generalized information-lossless automata. I

Journal Article · Sat Dec 31 23:00:00 EST 1994 · Cybernetics and Systems Analysis

OSTI ID:441165

Speranskii, D V

Huffman and Even introduced classes of abstract automata, which they called respectively information-lossless automata (ILL) and information-lossless automata of finite order (ILLFO). The underlying property of these automata is the ability to reconstruct unknown input sequences from observations of the output response, assuming that the true initial state of the automaton is known. Similar classes of automata introduced in are called essentially information-lossless automata, and they are capable of reconstructing the unknown input word without knowledge of the initial state of the automaton. It is only assumed that the set of possible initial states of the automaton is the set of all automaton states. In this paper we analyze a structural analog of an abstract ILL-automaton whose set of initial states may be of arbitrary cardinality. This class of automata is thus a generalization of the classical ILL-automata, which allows not only for the structure of the input and output alphabets, but also for the configuration of the set of possible initial states.

• OSTI ID: 441165
• Journal Information: Cybernetics and Systems Analysis, Journal Name: Cybernetics and Systems Analysis Journal Issue: 3 Vol. 30; ISSN CYASEC; ISSN 1060-0396
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
AUTOMATION