Representations of integers and language theory

  • Aldo de Luca
  • Antonio Restivo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 176)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [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. [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. [4].
    Eilenberg, S., "Automata, Languages and Machines", Academic Press, vol.A, 1974, vol.B, 1976.Google Scholar
  5. [5].
    Ginsburg, S. and E.H. Spanier, Bounded regular sets, Proc. American Math.Soc. 17 (1966) 1043–1049.Google Scholar
  6. [6].
    McNaughton, R. and S. Papert, "Counter-Free Automata", MIT Press, New York, 1971.Google Scholar
  7. [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. [8].
    Restivo,A., Codes and aperiodic languages, Lecture Notes in Computer Science, vol.2, Springer Verlag, 1973, pp. 175–181.Google Scholar
  9. [9].
    Schützenberger, M.P., On finite monoids having only trivial subgroups, Information and Control, 8(1965) 190–194.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Aldo de Luca
    • 1
  • Antonio Restivo
    • 2
  1. 1.Dipartimento di Matematica e ApplicazioniUniversità di NapoliItaly
  2. 2.Istituto di MatematicaUniversità di PalermoItaly

Personalised recommendations