Ambiguity and decision problems concerning number systems

  • Karel CulikII
  • Arto Salomaa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 154)


The representation of integers in arbitrary number systems is considered. The main emphasis is on problems concerning ambiguity, completeness and equivalence. We develop a rather general automata-theoretic method for solving such, in essence, purely number-theoretic problems. The method seems to be applicable in a variety of different situations.


Regular Expression Number System Regular Language Proper Form Automaton Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Honkala, J. (1982) Unique representation in number systems and L codes. Discrete Applied Mathematics, 4, 229–232.Google Scholar
  2. [2]
    Jelinek, F. (1968) Probabilistic Information Theory. McGraw-Hill, New York.Google Scholar
  3. [3]
    Jürgensen, H. and Kunze, M. (1980) Redundanzfreie Codes als Kryptocodes. Technical Report TI 8/80, Darmstadt Technical University.Google Scholar
  4. [4]
    Maurer, H.A., Salomaa, A. and Wood, D. (1982) L codes and number systems. Theoretical Computer Science, 22, 331–346.Google Scholar
  5. [5]
    Salomaa, A. (1973) Forma1 Languages. Academic Press, New York.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Karel CulikII
    • 1
  • Arto Salomaa
    • 2
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Mathematics DepartmentUniversity of TurkuFinland

Personalised recommendations