Skip to main content
SpringerLink
Log in

The Growth Ratio of Synchronous Rational Relations Is Unique

  • Conference paper
Developments in Language Theory (DLT 2006)

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

Included in the following conference series:

Abstract

We introduce α-synchronous relations for a rational number α. We show that if a rational relation is both α- and α′-synchronous for two different numbers α and α′, then it is recognizable. We give a synchronization algorithm for α-synchronous transducers. We also prove the closure under boolean operations and composition of α-synchronous relations.

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. Sakarovitch, J.: Éléments de théorie des automates. Vuibert (2003)

    Google Scholar 

  2. Cobham, A.: On the base-dependance of sets of numbers recognizable by finite automata. Math. Systems Theor. 3, 186–192 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  3. Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal Res. and Dev. 9, 47–68 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1972)

    Google Scholar 

  5. Frougny, C., Sakarovitch, J.: Synchronized relations of finite words. Theoret. Comput. Sci. 108, 45–82 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Marcus, B.: Factors and extensions of full shifts. Monats. Math. 88, 239–247 (1979)

    Article  MATH  Google Scholar 

  7. Adler, R.L., Coppersmith, D., Hassner, M.: Algorithms for sliding block codes. IEEE Trans. Inform. Theory IT-29, 5–22 (1983)

    Article  MathSciNet  Google Scholar 

  8. Khoussainov, B., Rubin, S.: Automatic structures: Overview and future directions. Journal of Automata, Languages and Combinatorics 8(2), 287–301 (2003)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris 7 & CNRS, 2, pl. Jussieu, 75251 Cedex 05, Paris

    Olivier Carton

Authors
  1. Olivier Carton
    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 California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carton, O. (2006). The Growth Ratio of Synchronous Rational Relations Is Unique. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_25

Download citation

  • DOI: https://doi.org/10.1007/11779148_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation