Advertisement

Cybernetics and Systems Analysis

, Volume 46, Issue 4, pp 574–582 | Cite as

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

  • A. N. Chebotarev
Article

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.

Keywords

specification language L* ∃-formula two-sided superword Σ-automaton elimination of quantifiers automata equivalence of specifications 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. N. Chebotarev, “Extension of the automaton specification logical language and the synthesis problem,” Cybernetics and Systems Analysis, No. 6, 756–765 (1996).Google Scholar
  2. 2.
    A. N. Chebotarev, “Approach to functional specification of automaton systems,” Cybernetics and Systems Analysis, No. 3, 330–337 (1993).Google Scholar
  3. 3.
    A. Gill, Introduction to the Theory of Finite State Machines [Russian translation], Nauka, Moscow (1966).MATHGoogle Scholar
  4. 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).Google Scholar
  5. 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).Google Scholar
  6. 6.
    A. N. Chebotarev, “Synthesis of an algorithm from its logical specification,” USiM, No. 5, 53–60 (2004).Google Scholar
  7. 7.
    A. N. Chebotarev, “Synthesis of nondeterministic automaton from its logical specification. I,” Cybernetics and Systems Analysis, No. 5, 641–649 (1995).Google Scholar
  8. 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).Google Scholar
  9. 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).Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2010

Authors and Affiliations

  1. 1.Cybernetics InstituteNational Academy of Sciences of UkraineKievUkraine

Personalised recommendations