Skip to main content
SpringerLink
Log in

A Hierarchy of Irreducible Sofic Shifts

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3153))

Abstract

We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the 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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Béal, M.-P.: Codage Symbolique. Masson (1993)

    Google Scholar 

  2. Béal, M.-P., Fiorenzi, F., Perrin, D.: The syntactic graph of a sofic shift. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 282–293. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Beauquier, D.: Minimal automaton for a factorial transitive rational language. Theoret. Comput. Sci. 67, 65–73 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)

    MATH  Google Scholar 

  5. Blanchard, F.: Codes engendrant certains systèmes sofiques. Theoret. Comput. Sci. 68(3), 253–265 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Boyle, M., Kitchens, B.P., Marcus, B.H.: A note on minimal covers for sofic shifts. Proc. Amer. Math. Soc. 95, 403–411 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fiebig, D., Fiebig, U.-R., Jonoska, N.: Multiplicities of covers for sofic shifts. Theoret. Comput. Sci. 1-2, 349–375 (2001)

    Article  MathSciNet  Google Scholar 

  8. Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, 320–337 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jonoska, N.: A conjugacy invariant for reducible sofic shifts and its semigroup characterizations. Israel J. Math. 106, 221–249 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Karabed, R., Marcus, B.H.: Sliding-block coding for input-restricted channels. IEEE Trans. Inform. Theory IT-34, 2–26 (1988)

    Article  MathSciNet  Google Scholar 

  11. Kitchens, B.P.: Symbolic Dynamics: one-sided, two-sided and countable state Markov shifts. Springer, Heidelberg (1997)

    Google Scholar 

  12. Lind, D.A., Marcus, B.H.: An Introduction to Symbolic Dynamics and Coding, Cambridge (1995)

    Google Scholar 

  13. Marcus, B.H.: Sofic systems and encoding data. IEEE Trans. Inform. Theory IT-31, 366–377 (1985)

    Article  Google Scholar 

  14. Margolis, S.W.: On the syntactic transformation semigroup of a language generated by a finite biprefix code. Theoret. Comput. Sci. 21(2), 225–230 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  15. Nasu, M.: An invariant for bounded-to-one factor maps between transitive sofic subshifts. Ergodic Theory Dynam. Systems 5, 89–105 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  16. Nasu, M.: Topological conjugacy for sofic systems. Ergodic Theory Dynam. Systems 6(2), 265–280 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  17. Pin, J.-É.: Varieties of Formal Languages. Plenum Publishing Corporation, New York (1986)

    MATH  Google Scholar 

  18. Weiss, B.: Subshifts of finite type and sofic systems. Monats. für Math. 77, 462–474 (1973)

    Article  MATH  Google Scholar 

  19. Williams, S.: Covers of non-almost-finite-type systems. Proc. Amer. Math. Soc. 104, 245–252 (1988)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Gaspard-Monge, Université de Marne-la-Vallée, 77454 Cedex 2, Marne-la-Vallée, France

    Marie-Pierre Béal, Francesca Fiorenzi & Dominique Perrin

Authors
  1. Marie-Pierre Béal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesca Fiorenzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dominique Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Béal, MP., Fiorenzi, F., Perrin, D. (2004). A Hierarchy of Irreducible Sofic Shifts. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

  • Online ISBN: 978-3-540-28629-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation