On Information Lossless Automata of Finite Order
- 1 August 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (4) , 561-569
- https://doi.org/10.1109/pgec.1965.263996
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- On Information Lossless Automata of Finite OrderIEEE Transactions on Electronic Computers, 1965
- Test for synchronizability of finite automata and variable length codesIEEE Transactions on Information Theory, 1964
- Tests for unique decipherabilityIEEE Transactions on Information Theory, 1963
- Generalized automata and their information losslessnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1962
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959
- Canonical Forms for Information-Lossless Finite-State Logical MachinesIRE Transactions on Circuit Theory, 1959
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955