Skip to main content
SpringerLink
Log in

Asynchronous trace-matching automata

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper presents algorithms for solving several matching problems on Mazurkiewicz traces. The creation of the algorithms is reduced to the construction of automata that recognize corresponding rational trace languages. Such languages and their properties were studied by many authors. This paper considers trace languages used in solving concrete problems that have analogs in stringology.

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. V. Dikert and G. Rozenberg, The Book of Traces, Handbook of Formal Languages, Vol. 3, Beyond Words, Springer, N.Y. (1997).

    Google Scholar 

  2. A. Mazurkiewicz, “Concurrent program schemes and their interpretations,” in: DAIMI Rep. PB 78, Aarhus University, Aarhus (1977), pp. 16–23.

  3. W. Zielonka, “Notes on finite asynchronous automata,” RAIRO Inf. Th. Appl., 21, No. 2, 99–135 (1987).

    MathSciNet  MATH  Google Scholar 

  4. C. Duboc, “Mixed product and asynchronous automata,” TCS, 48, 183–199 (1986).

    Article  MathSciNet  MATH  Google Scholar 

  5. R. Morin, “Decompositions of asynchronous systems,” CONCUR’98, LNCS 1466, 549–564 (1998).

  6. R. Morin, “Concurrent automata vs. asynchronous systems,” LNCS, Vol. 3618, 686–698 (2005).

    MathSciNet  Google Scholar 

  7. A. Avellone and M. Goldwurm, “Analysis of algorithms for the recognition of rational and context-free trace languages,” Theoretical Inform. and Appl., Vol. 32, Nos. 4–6, 141–152 (1998).

    MathSciNet  Google Scholar 

  8. R. A. Baeza-Yates, “Searching sequences,” Theoretical Comput. Sci., 78, No. 2, 363–376 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  9. M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, Cambridge Univ. Press (2007).

    Book  MATH  Google Scholar 

  10. M. Crochemore and W. Rytter, Jewels of Stringology, World Sci. Publ. Co. Rtc. Ltd. (2002).

  11. M. Crochemore and C. Hancart, “Automata for matching patterns,” in: Handbook of Formal Languages, Vol. 2, Linear Modeling, Springer, N.Y. (1997), pp. 399–462.

  12. A. V. Aho and M. J. Corasick, “Efficient string matching: An aid to bibliographic research,” CACM, 18, 333–340 (1975).

    MathSciNet  MATH  Google Scholar 

  13. K. V. Shahbazyan and Yu. H. Shoukourian, “Inclusion problems in trace monoids,” in: CSIT (2009), pp. 65–69.

Download references

Author information

Authors and Affiliations

  1. Institute for Informatics and Automation Problems, Yerevan, Armenia

    K. V. Shahbazyan & Yu. H. Shoukourian

Authors
  1. K. V. Shahbazyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. H. Shoukourian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. V. Shahbazyan.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 3–11, May–June 2012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shahbazyan, K.V., Shoukourian, Y.H. Asynchronous trace-matching automata. Cybern Syst Anal 48, 323–329 (2012). https://doi.org/10.1007/s10559-012-9411-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-012-9411-1

Keywords

Search

Navigation