Complexity of acceptors for prefix codes (Corresp.)

DOI10.1109/TIT.1976.1055546zbMATH Open0324.94006OpenAlexW1977604687MaRDI QIDQ4088716FDOQ4088716

Peter Eliaš, Donna J. Brown

Publication date: 1976

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1976.1055546

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (1)

• Minimum times and memories needed to compute the values of a function

This page was built for publication: Complexity of acceptors for prefix codes (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088716)