Skip to main content

Representations of integers and language theory

  • Communications
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cobham, A., On the base-dependence of sets of numbers recognizable by finite automata, Mathematical System Theory, 3 (1969) 186–198.

    Google Scholar 

  2. Culik, II, K. and A. Salomaa, Ambiguity and decision problems concerning number systems, Lecture Notes in Computer Science, vol. 154, Springer Verlag, 1983, pp. 137–146.

    Google Scholar 

  3. De Luca, A. and A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Information and Control, 44(1980) 300–319.

    Google Scholar 

  4. Eilenberg, S., "Automata, Languages and Machines", Academic Press, vol.A, 1974, vol.B, 1976.

    Google Scholar 

  5. Ginsburg, S. and E.H. Spanier, Bounded regular sets, Proc. American Math.Soc. 17 (1966) 1043–1049.

    Google Scholar 

  6. McNaughton, R. and S. Papert, "Counter-Free Automata", MIT Press, New York, 1971.

    Google Scholar 

  7. Restivo, A., Mots sans répétitions et languages rationnels bornés, R.A.I.R.O.,I.T. 11(1977) 197–202.

    Google Scholar 

  8. Restivo,A., Codes and aperiodic languages, Lecture Notes in Computer Science, vol.2, Springer Verlag, 1973, pp. 175–181.

    Google Scholar 

  9. Schützenberger, M.P., On finite monoids having only trivial subgroups, Information and Control, 8(1965) 190–194.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Luca, A., Restivo, A. (1984). Representations of integers and language theory. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030323

Download citation

  • DOI: https://doi.org/10.1007/BFb0030323

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics