On Information Lossless Automata of Finite Order

DOI10.1109/PGEC.1965.263996MaRDI QIDQ5551176zbMATH OpenFDO

Authors Shimon Even

Publication date 1965

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/PGEC.1965.263996

zbMATH Keywords

languages, automata, networks

Cited in

(11)

• The base of the intersection of two free submonoids
• Establishing certain bounds concerning finite automata
• Generalized information-lossless automata. I
• Generalized information-lossless automata of finite order. II
• Free and almost-free subsemigroups of a free semigroup
• Break finite automata public key cryptosystem
• Reversion of outputs of fuzzy discrete systems
• scientific article; zbMATH DE number 7300422 (Why is no real title available?)
• CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
• Isomorphism between two vector general fuzzy automata
• Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)

This page was built for publication: On Information Lossless Automata of Finite Order

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