Skip to main content
SpringerLink
Log in

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

  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

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, “Synthesis of Σ-automata specified in the first order logical languages LP and LF,” Cybernetics and Systems Analysis, Vol. 54, No. 4, 527–540 (2018).

    Article  MathSciNet  Google Scholar 

  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).

    Article  MathSciNet  Google Scholar 

  3. D. Perrin and J.- E. Pin, Infinite words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics Series, Vol. 141, Elsevier, Amsterdam (2004).

  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).

    Article  MathSciNet  Google Scholar 

  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).

    Article  MathSciNet  Google Scholar 

  6. H. Calbrix, M. Nivat, and A. Podelsky, “Ultimately periodic words of rational ω-languages,” Lecture Notes in Computer Science, Vol. 802, 554–566 (1994).

    Article  MathSciNet  Google Scholar 

  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).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, 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. 5, September–October, 2019, pp. 47–57.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chebotarev, A.N. Detecting Fictitious States in a Σ-Automaton Synthesized from Its Specification in the Language LP. Cybern Syst Anal 55, 742–751 (2019). https://doi.org/10.1007/s10559-019-00184-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-019-00184-x

Keywords

Search

Navigation