Establishing certain bounds concerning finite automata

Authors:
Zvi Kohavi;Joseph Winograd
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1973

Citing 3
Cited 2

On Finite-Memory Sequential Machines

IEEE Transactions on Computers
On the Lower Bound to the Memory of Finite State Machines

IEEE Transactions on Computers
Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines

IEEE Transactions on Computers

Synchronizing Automata and the Černý Conjecture

Language and Automata Theory and Applications
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we establish a number of bounds concerning reduced finite-state machines. In particular, we prove that the least upper bound, L, on the length of synchronizing sequences is bounded bywhere n is the number of states. We also prove that there exists a machine with a fixed number of inputs and outputs which is information lossless of maximal order. Finally we prove that for every n there exists a machine that is definitely diagnosable (or observable) of order @m = n(n - 1)/2.