On Information Lossless Automata of Finite Order
On Information Lossless Automata of Finite Order
复制标题
有限阶信息无损自动机
DOI：
10.1109/pgec.1965.263996
复制
发表时间：
1965
期刊：
影响因子：
--
通讯作者：
S. Even
中科院分区：
文献类型：
--
作者：
S. Even
编码图是一种包含所有类型的有限自动机和代码作为特例的模型。本文给出了编码图的无信息损失和有限阶无信息损失的一种检验方法。给出了有效的计算方法，使计算简单化、机械化。应用测试有限确定自动机的讨论和构造一个解码器的方法，为一个给定的有限自动机，是信息无损的有限阶，描述。
A coding graph is a model which contains all the types of finite automata and codes as special cases. A test for information losslessness and for information losslessness of finite order of a coding graph is described. Efficient methods of computation are given which make the calculation simple and mechanizable. The application of the tests to finite deterministic automata is discussed and a method of constructing a decoder for a given finite automaton that is information lossless of finite order, is described.