Perrin, Dominique; Pin, Jean-Eric First-order logic and star-free sets. (English) Zbl 0618.03015 J. Comput. Syst. Sci. 32, 393-406 (1986). Reviewer: Z.Stachniak MSC: 03D05 03B10 68Q45 PDFBibTeX XMLCite \textit{D. Perrin} and \textit{J.-E. Pin}, J. Comput. Syst. Sci. 32, 393--406 (1986; Zbl 0618.03015) Full Text: DOI
Beauquier, D.; Perrin, D. Codeterministic automata on infinite words. (English) Zbl 0571.68073 Inf. Process. Lett. 20, 95-98 (1985). Reviewer: A.V.Anisimov MSC: 68Q45 PDFBibTeX XMLCite \textit{D. Beauquier} and \textit{D. Perrin}, Inf. Process. Lett. 20, 95--98 (1985; Zbl 0571.68073) Full Text: DOI
Dauchet, M.; Timmerman, E. Continuous monoids and yields of infinite trees. (English) Zbl 0605.06012 RAIRO, Inf. Théor. Appl. 20, 251-274 (1986). Reviewer: K.H.Kim MSC: 06F05 20M35 05C05 03D05 PDFBibTeX XMLCite \textit{M. Dauchet} and \textit{E. Timmerman}, RAIRO, Inform. Théor. Appl. 20, 251--274 (1986; Zbl 0605.06012) Full Text: DOI EuDML
Devolder, J.; Timmerman, E. Finitary codes for biinfinite words. (English) Zbl 0754.68066 RAIRO, Inform. Théor. Appl. 26, No. 4, 363-386 (1992). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Devolder} and \textit{E. Timmerman}, RAIRO, Inform. Théor. Appl. 26, No. 4, 363--386 (1992; Zbl 0754.68066) Full Text: DOI EuDML