Abstract
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.
This work was supported by Natural Sciences and Engineering Research Council of Canada, Grant Nos. A7403 and A1617. The work was done while the second author was visiting the University of Waterloo during the academic year 1981-82.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Honkala, J. (1982) Unique representation in number systems and L codes. Discrete Applied Mathematics, 4, 229–232.
Jelinek, F. (1968) Probabilistic Information Theory. McGraw-Hill, New York.
Jürgensen, H. and Kunze, M. (1980) Redundanzfreie Codes als Kryptocodes. Technical Report TI 8/80, Darmstadt Technical University.
Maurer, H.A., Salomaa, A. and Wood, D. (1982) L codes and number systems. Theoretical Computer Science, 22, 331–346.
Salomaa, A. (1973) Forma1 Languages. Academic Press, New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culik, K., Salomaa, A. (1983). Ambiguity and decision problems concerning number systems. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036904
Download citation
DOI: https://doi.org/10.1007/BFb0036904
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive