Skip to main content
SpringerLink
Log in

Sufficient conditions of deterministic implementation of finite-state automata with retention of the numbers of their states

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The following three conditions for nondeterministic finite-state automata are defined: input embeddability, output embeddability, and input decomposability. Automata satisfying these conditions are called nondeterministic automata with embeddability. A method for deterministic implementation of such automata with retention of the numbers of their states is proposed. These automata correspond to block-procedural high-level programming languages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. A. Trakhtenbrot and Ya. M. Barzdin, Finite-State Automata (Behavior and Synthesis)[in Russian], Nauka, Moscow (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Kliment Okhridskii University, Sofia, Bulgaria

    D. P. Shishkov

Authors
  1. D. P. Shishkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 55–62, May–June, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shishkov, D.P. Sufficient conditions of deterministic implementation of finite-state automata with retention of the numbers of their states. Cybern Syst Anal 36, 359–365 (2000). https://doi.org/10.1007/BF02732986

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02732986

Keywords

Search

Navigation