Article
Licensed
Unlicensed
Requires Authentication
On distinguishability of states of automata
-
P. A. Panteleev
Published/Copyright:
August 1, 2003
We investigate variants of the notion of distinguishability of automata. The distinguishability in the sense of a given metric on the set of output symbols, the k-distinguishability and the ∞-distinguishability are considered. For each variant the exact value of the corresponding Shannon function is obtained.We find the minimum value of the parameter k for which the k-distinguishability implies the ∞-distinguishability.
Published Online: 2003-08-01
Published in Print: 2003-08-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Boolean reducibility
- On the complexity of testing primality by homogeneous structures
- On distinguishability of states of automata
- On glueing states of an automaton
- Almost layer-finiteness of the periodic part of groups without involutions
- The structure and methods of generation of closed classes of graphs
- On asymptotic expansions for the distributions of the number of cycles in a random permutation
Articles in the same Issue
- Boolean reducibility
- On the complexity of testing primality by homogeneous structures
- On distinguishability of states of automata
- On glueing states of an automaton
- Almost layer-finiteness of the periodic part of groups without involutions
- The structure and methods of generation of closed classes of graphs
- On asymptotic expansions for the distributions of the number of cycles in a random permutation
