A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On number systems with finite degree of ambiguity
Tekijät: Honkala J
Kustantaja: ACADEMIC PRESS INC
Julkaisuvuosi: 1998
Journal: Information and Computation
Tietokannassa oleva lehden nimi: INFORMATION AND COMPUTATION
Lehden akronyymi: INFORM COMPUT
Vuosikerta: 145
Numero: 1
Aloitussivu: 51
Lopetussivu: 63
Sivujen määrä: 13
ISSN: 0890-5401
DOI: https://doi.org/10.1006/inco.1998.2718
Tiivistelmä
We show that it is decidable whether or not a given n-recognizable set is representable by a number system having finite degree of ambiguity. As a corollary we obtain an algorithm for computing the degree of ambiguity of a given set defined by a number system. (C) 1998 Academic Press.
We show that it is decidable whether or not a given n-recognizable set is representable by a number system having finite degree of ambiguity. As a corollary we obtain an algorithm for computing the degree of ambiguity of a given set defined by a number system. (C) 1998 Academic Press.
Turun yliopiston Tutkimustietojärjestelmän portaali