Cybernetics

, Volume 6, Issue 3, pp 215–222 | Cite as

The number of states of the product of automaton mappings

  • Peter Horvath
Article
Received:
  • 11 Downloads

Keywords

Operating System Artificial Intelligence System Theory Automaton Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    J. N. Raney, “Sequential functions,” in: Kibernetika Sbornik, No. 3 (1961).Google Scholar
  2. 2.
    F. Horejŝ, “Transformations defined by finite automata,” in: Problemy Kibernetika, No. 9 (1963).Google Scholar
  3. 3.
    V. M. Glushkov, “Abstract theory of automata,” Usp. Matem. Nauk.16, No. 5 (1961).Google Scholar
  4. 4.
    A. Gill, “Cascade finite-state machines,” IRE Transactions,EC-10, No. 3 (1961).Google Scholar
  5. 5.
    M. A. Gavrilov, “On refinement of the estimate for determining the number of states in the composition of finite automata,” Avtomat. i Telemenkhan.,25, No. 11 (1964).Google Scholar

Copyright information

© Consultants Bureau 1973

Authors and Affiliations

  • Peter Horvath

There are no affiliations available

Personalised recommendations