Star-free sets of integers. (English) Zbl 0597.68060

Summary: Recognizable sets of nonnegative integers which can be represented in suitable bases by star-free languages are considered.


68Q45 Formal languages and automata
Full Text: DOI


[1] Cobham, A., On the base-dependence of sets of numbers recognizable by finite automata, Math. systems theory, 3, 186-198, (1969) · Zbl 0179.02501
[2] Culik, K.; Salomaa, A., Ambiguity and decision problems concerning number systems, (), 137-146
[3] De Luca, A.; Restivo, A., A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Inform. and control, 44, 300-319, (1980) · Zbl 0441.68087
[4] De Luca, A.; Restivo, A., Representations of integers and language theory, (), 407-415
[5] Eilenberg, S.; Eilenberg, S., ()
[6] Ginsburg, S.; Spanier, E.H., Bounded regular sets, (), 1043-1049 · Zbl 0147.25301
[7] Latteux, M.; Thierrin, G., On bounded context-free languages, (1983), Universitéde Lille 1, N.I.T.-52 · Zbl 0514.68072
[8] Maurer, H.A.; Nivat, M., Rational bijection of rational sets, Acta inform., 13, 365-378, (1980) · Zbl 0432.68051
[9] McNaughton, R.; Papert, S., Counter-free automata, (1971), MIT Press New York · Zbl 0232.94024
[10] Restivo, A., Mots sans répétitions et langages rationnels bornés, RAIRO inform. théor., 11, 197-202, (1977) · Zbl 0371.68023
[11] Restivo, A., Codes and aperiodic languages, (), 175-181 · Zbl 0277.68039
[12] Schützenberger, M.P., On finite monoids having only trivial subgroups, Inform. and control, 8, 190-194, (1965) · Zbl 0131.02001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.