Decomposing a kind of weakly invertible finite automata with delay 2

DOI10.1007/BF02948905zbMath1046.68071OpenAlexW2060871291MaRDI QIDQ1415937

Gang Yao

Publication date: 9 December 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948905

zbMATH Keywords

finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Controllability, reachability, and stabilizability of finite automata: a controllability matrix method

Cites Work

• Unnamed Item
• Input-trees of finite automata and application to cryptanalysis
• Two varieties of finite automaton public key cryptosystem and digital signatures
• Structure of weakly invertible semi-input-memory finite automata with delay 1

This page was built for publication: Decomposing a kind of weakly invertible finite automata with delay 2