Parallel computations and finite automata on semilattices
First, we outline a possibility to associate with parallel computations on a semilattice a finite automaton defined on semilattices which models the computations, and then we study three problems concerning the design of finite automata on semilattices — synthesis, minimization, and decomposition.
Unable to display preview. Download preview PDF.
- 1.Agibalov, G.P.: Discrete automata on semilattices. Tomsk, Tomsk University (1993) (in Russian)Google Scholar
- 2.Agibalov, G.P.: Finite automata on partially ordered sets. 11th IFAC World Congress Proceedings 3 (1991)Google Scholar
- 3.Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice-Hall, Englewood Cliffs (1966).Google Scholar