Opacity of a finite automaton, method of calculation and the Ising chain
From MaRDI portal
Publication:1861564
DOI10.1016/S0166-218X(01)00363-8zbMath1011.68046MaRDI QIDQ1861564
Publication date: 9 March 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Categories of machines, automata (18B20)
Related Items (1)
Cites Work
This page was built for publication: Opacity of a finite automaton, method of calculation and the Ising chain