Advertisement

Cybernetics and Systems Analysis

, Volume 55, Issue 5, pp 742–751 | Cite as

Detecting Fictitious States in a Σ-Automaton Synthesized from Its Specification in the Language LP

  • A. N. ChebotarevEmail author
Article
  • 1 Downloads

Abstract

Synthesizing a deterministic Σ-automaton specified in the language LP consists in sequentially executing two procedures. The first constructs an automaton with a subautomaton identical to the automaton specified, and the other eliminates the states that do not belong to this subautomaton. Such states are called fictitious. A method for detecting fictitious states is considered. The obtained results allow to reduce the detection of fictitious states to finding the so-called basic cycles and eventually to checking the membership of a periodic left-infinite word in some –ω-regular set.

Keywords

Σ-automaton fictitious state initial strongly connected subautomaton normal form ω-regular set basic cycle 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. N. Chebotarev, “Synthesis of Σ-automata specified in the first order logical languages LP and LF,” Cybernetics and Systems Analysis, Vol. 54, No. 4, 527–540 (2018).MathSciNetCrossRefGoogle Scholar
  2. 2.
    A. N. Chebotarev, “Synthesis of a procedural representation of an automaton specified in the logical language L*. II,” Cybernetics and Systems Analysis, Vol. 33, No. 6, 845–853 (1997).MathSciNetCrossRefGoogle Scholar
  3. 3.
    D. Perrin and J.- E. Pin, Infinite words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics Series, Vol. 141, Elsevier, Amsterdam (2004).Google Scholar
  4. 4.
    D. Bresolin, A. Montanari, and G. Puppis, “A theory of ultimately periodic languages and automata with an application to time granularity,” Acta Informatica, Vol. 46, No. 5, 331–360 (2009).MathSciNetCrossRefGoogle Scholar
  5. 5.
    A. N. Chebotarev, “Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of Σ-automata,” Cybernetics and Systems Analysis, Vol. 53, No. 4, 512–523 (2017).MathSciNetCrossRefGoogle Scholar
  6. 6.
    H. Calbrix, M. Nivat, and A. Podelsky, “Ultimately periodic words of rational ω-languages,” Lecture Notes in Computer Science, Vol. 802, 554–566 (1994).MathSciNetCrossRefGoogle Scholar
  7. 7.
    A. N. Chebotarev, “Problems of synthesis of Σ-automata specified in languages LP and LF of first order logic,” Cybernetics and Systems Analysis, Vol. 53, No. 5, 675–683 (2017).MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.V. M. Glushkov Institute of CyberneticsNational Academy of Sciences of UkraineKyivUkraine

Personalised recommendations