Characterization of opaque automata

Authors:
Gong-Liang Chen;Jia-Yan Yao
Affiliations:
Department of Mathematics, Nonlinear Science Centre, Wuhan University, Wuhan 430072, People's Republic of China;Department of Mathematics, Nonlinear Science centre, Wuhan University, Wuhan 430072, People's Republic of China
Venue:
Discrete Mathematics
Year:
2002

Citing 3
Cited 1

Opacités des automates finis

Discrete Mathematics
Automata, Languages, and Machines

Automata, Languages, and Machines
Opacity of a finite automaton, method of calculation and the Ising chain

Discrete Applied Mathematics

Opacity of a finite automaton, method of calculation and the Ising chain

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

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.