Title of article
Characterization of opaque automata Original Research Article
Author/Authors
Gong-Liang Chen، نويسنده , , Jia-Yan Yao ، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
14
From page
65
To page
78
Abstract
A finite automaton is a machine which transforms any sequence over an alphabet into a sequence over another alphabet. Its opacity measures the distortion between the input and the output. A finite automaton is called opaque if its opacity is maximal. In this article we shall continue our study on the opacity of a finite automaton and characterize opaque automata.
Keywords
Opaque automaton , Finite automaton , Opacity
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
950000
Link To Document