Test for synchronizability of finite automata and variable length codes
- 1 July 1964
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 10 (3), 185-189
- https://doi.org/10.1109/tit.1964.1053683
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Tests for unique decipherabilityIEEE Transactions on Information Theory, 1963
- Examples of Abstract MachinesIEEE Transactions on Electronic Computers, 1962
- Note on unique decipherabilityIEEE Transactions on Information Theory, 1959
- Variable-Length Binary EncodingsBell System Technical Journal, 1959
- Full decodable code-word setsIEEE Transactions on Information Theory, 1959
- On an application of semi groups methods to some problems in codingIRE Transactions on Information Theory, 1956
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955