Skip to main content
SpringerLink
Log in

Symbolic Dynamics, Flower Automata and Infinite Traces

  • Conference paper
Implementation and Application of Automata (CIAA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6482))

Included in the following conference series:

  • 576 Accesses

Abstract

Considering a finite alphabet as a set of allowed instructions, we can identify finite words with basic actions or programs. Hence infinite paths on a flower automaton can represent order in which these programs are executed and a flower shift related with it represents list of instructions to be executed at some mid-point of the computation.

Each such list could be converted into an infinite real trace when an additional information is given, namely which instructions can be executed simultaneously (so that way we obtain a schedule for a process of parallel computation). In this paper we investigate when obtained in such a way objects (sets of infinite real traces) are well defined from the dynamical point of view and to what extent they share properties of underlying flower shifts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D.: Theory of codes, Pure and Applied Mathematics, vol. 117. Academic Press Inc., Orlando (1985)

    MATH  Google Scholar 

  2. Cartier, P., Foata, D.: Problèmes combinatories de commutation et réarrangements. Lecture Notes in Mathematics. Springer, Heidelberg (1969)

    Book  MATH  Google Scholar 

  3. Diekert, V. (ed.): Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  4. Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific Publishing Co. Inc., River Edge (1995)

    Google Scholar 

  5. Foryś, W., Oprocha, P.: Infinite Traces and Symbolic Dynamics. Theory Comput. Syst. 45, 133–149 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Foryś, W., Oprocha, P.: Infinite Traces and Symbolic Dynamics - Minimal Shift Case. Fundamenta Informatica (to appear)

    Google Scholar 

  7. Garcia Guirao, J.L., Foryś, W., Oprocha, P.: A dynamical model of parallel computation on bi-infinite time-scale. J.Comput. Appl. Math. (to appear)

    Google Scholar 

  8. Kaldewaij, A.: Trace theory and the specification of concurrent systems. In: Denvir, B.T., Jackson, M.I., Harwood, W.T., Wray, M.J. (eds.) ACS 1985. LNCS, vol. 207, pp. 211–221. Springer, Heidelberg (1985)

    Google Scholar 

  9. Kůrka, P: Topological and Symbolic Dynamics. Cours Spécialisés [Specialized Courses] 11. Société Mathématique de France, Paris (2003)

    Google Scholar 

  10. Kwiatkowska, M.: A metric for traces. Inform. Process. Lett. 35, 129–135 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Aarhus University 78, 1–45 (1977)

    Google Scholar 

  12. Restivo, A.: Finitely generated sofic systems. Theoret. Comput. Sci. 65, 265–270 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Williams, S.: Notes on renewal systems. Proc. Amer. Math. Soc. 110, 851–853 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Jagiellonian University, Łojasiewicza 6, 30-348, Kraków, Poland

    Wit Foryś & Slawomir Bakalarski

  2. Departamento de Matemáticas, Universidad de Murcia, Campus de Espinardo, 30100, Murcia, Spain

    Piotr Oprocha

  3. Faculty of Applied Mathematics, AGH University of Science and Technology, al. Mickiewicza 30, 30-059, Kraków, Poland

    Piotr Oprocha

Authors
  1. Wit Foryś
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Oprocha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Slawomir Bakalarski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Foryś, W., Oprocha, P., Bakalarski, S. (2011). Symbolic Dynamics, Flower Automata and Infinite Traces. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18098-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18097-2

  • Online ISBN: 978-3-642-18098-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation