Abstract
The problem of determining the effectiveness of approximate methods for minimizing the number of states of incompletely specified discrete automata (or, as they are sometimes called, partial automata) is of practical interest. Evaluations of algorithms are necessary, first of all, in choosing the best algorithm for solving some definite class of problems and, in the second place, for verifying the putative improvements borne by algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature Cited
V. I. Ostrovskii, “Development of methods of evaluating algorithms on the basis of statistical experiments on digital computer,” in: Account of Topic 6.1 of the Plan for International Cooperation within the Borders of SEV, Tr. Sib. Fizikotekhn. Inst., Tomsk (1965).
Logical Language for the Representation of Algorithms for the Synthesis of Relay Devices, Izd. “Nauka” (1965).
A. D. Zakrevskii, “On synthesizing sequential automata,” Tr. Sib. Fizikotekhn. Inst., Vol. 40 (1961).
M. C. Pauli and S. H. Unger, “Minimizing the number of states in incompletely specified sequential switching functions,” IRE Trans., EC-8, No. 3 (1959).
A. D. Zakrevskii, “Automation of the synthesis of discrete automata on the basis of algorithmic language LYaPAS,” in: Computing Systems, Vol. 18, Novosibirsk (1965).
Yu. V. Pottosin, “Algorithms for minimizing the number of states of a discrete automaton,” in: Logical Language for the Representation of Algorithms for the Synthesis of Relay Devices, Izd. “Nauka” (1966).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1969 Consultants Bureau, New York
About this chapter
Cite this chapter
Pottosin, Y.V. (1969). Experimental Evaluation of One Method of Minimizing the Number of States of Discrete Automata. In: Lazarev, V.G., Zakrevskii, A.V. (eds) Synthesis of Digital Automata / Problemy Sinteza Tsifrovykh Avtomatov / Проƃлемы Синтеза Цифровых Автоматов. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-9033-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9033-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-9035-0
Online ISBN: 978-1-4684-9033-6
eBook Packages: Springer Book Archive