Structure of weakly invertible semi-input-memory finite automata with delay 1
From MaRDI portal
Publication:1850654
DOI10.1007/BF02943277zbMath1012.68104OpenAlexW2560779797MaRDI QIDQ1850654
Publication date: 23 April 2003
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02943277
Related Items
Decomposing a kind of weakly invertible finite automata with delay 2, Structure of weakly invertible semi-input-memory finite automata with delay 2.
Cites Work
- \(R_ aR_ b\) transformation of compound finite automata over commutative rings
- On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\)
- On the structure of binary feedforward inverses with delay 2
- A necessary condition on invertibility of finite automata
- Input-trees of finite automata and application to cryptanalysis
- Constructing finite automata with invertibility by transformation method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item