scientific article; zbMATH DE number 3986647
From MaRDI portal
Publication:3750124
zbMATH Open0609.68041MaRDI QIDQ3750124FDOQ3750124
Publication date: 1979
Title of this publication is not available (Why is that?)
Recommendations
- A necessary condition on invertibility of finite automata
- Problems in theory of cryptanalytical invertibility of finite automata
- Finite Automata and Application to Cryptography
- CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
- Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985)
delayexperimentslinear automatalinear shift register sequenceslogic designlogic networksstate assignmentsautonomous finite automata
Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)
Cited In (17)
- A necessary condition on invertibility of finite automata
- Decomposing a kind of weakly invertible finite automata with delay 2
- Constructing finite automata with invertibility by transformation method
- Structure of weakly invertible semi-input-memory finite automata with delay 2.
- Structure of weakly invertible semi-input-memory finite automata with delay 1
- Weak invertibility of linear finite automata. I: Classification and enumeration of transfer functions
- Abelian Invertible Automata
- On the structure of binary feedforward inverses with delay 2
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Break Finite Automata Public Key Cryptosystem
- CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
- Title not available (Why is that?)
- On relations between \(R_ aR_ b\) transformation and canonical diagonal form of \(\lambda\)-matrix
- Title not available (Why is that?)
- Classification and enumeration of matched free response matrices of linear finite automata
- On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\)
- \(R_ aR_ b\) transformation of compound finite automata over commutative rings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750124)
