Skip to main content
SpringerLink
Log in

Transformation of a language L* specification of an FSM into an automata equivalent specification in the language L

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A method is proposed to transform an FSM specification in the language L* into a specification in the language L. Using additional predicate symbols, the former specification is first transformed into a specification of an FSM with finite memory. Then this specification is transformed into an automata equivalent specification in the language L.

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. A. N. Chebotarev, “Extension of the automaton specification logical language and the synthesis problem,” Cybernetics and Systems Analysis, No. 6, 756–765 (1996).

  2. A. N. Chebotarev, “Approach to functional specification of automaton systems,” Cybernetics and Systems Analysis, No. 3, 330–337 (1993).

  3. A. Gill, Introduction to the Theory of Finite State Machines [Russian translation], Nauka, Moscow (1966).

    MATH  Google Scholar 

  4. A. N. Chebotarev, “Synthesis of a procedural representation of an automaton specified in the logical language L*. I,” Cybernetics and Systems Analysis, No. 4, 505–515 (1997).

  5. A. N. Chebotarev, “Synthesis of a procedural representation of an automaton specified in the logical language L*. II,” Cybernetics and Systems Analysis, No. 6, 845–853 (1997).

  6. A. N. Chebotarev, “Synthesis of an algorithm from its logical specification,” USiM, No. 5, 53–60 (2004).

  7. A. N. Chebotarev, “Synthesis of nondeterministic automaton from its logical specification. I,” Cybernetics and Systems Analysis, No. 5, 641–649 (1995).

  8. A. N. Chebotarev, “The class of L* -language formulas that specify automata with finite memory,” Cybernetics and Systems Analysis, No. 1, 3–8 (2010).

  9. A. N. Chebotarev, and O. I. Kurivchak, “Approximation of sets of superwords by L-language formulas,” Cybernetics and Systems Analysis, No. 6, 779–786 (2007).

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

    A. N. Chebotarev

Authors
  1. A. N. Chebotarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. N. Chebotarev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 60–69, July–August 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chebotarev, A.N. Transformation of a language L* specification of an FSM into an automata equivalent specification in the language L. Cybern Syst Anal 46, 574–582 (2010). https://doi.org/10.1007/s10559-010-9234-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9234-x

Keywords

Search

Navigation