First-order properties of trees, star-free expressions, and aperiodicity
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 25 (1991) no. 2, pp. 125-145.
@article{ITA_1991__25_2_125_0,
     author = {Heuter, Uschi},
     title = {First-order properties of trees, star-free expressions, and aperiodicity},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {125--145},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {2},
     year = {1991},
     zbl = {0741.68065},
     mrnumber = {1110980},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_2_125_0/}
}
TY  - JOUR
AU  - Heuter, Uschi
TI  - First-order properties of trees, star-free expressions, and aperiodicity
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
DA  - 1991///
SP  - 125
EP  - 145
VL  - 25
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_2_125_0/
UR  - https://zbmath.org/?q=an%3A0741.68065
UR  - https://www.ams.org/mathscinet-getitem?mr=1110980
LA  - en
ID  - ITA_1991__25_2_125_0
ER  - 
%0 Journal Article
%A Heuter, Uschi
%T First-order properties of trees, star-free expressions, and aperiodicity
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 125-145
%V 25
%N 2
%I EDP-Sciences
%G en
%F ITA_1991__25_2_125_0
Heuter, Uschi. First-order properties of trees, star-free expressions, and aperiodicity. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 25 (1991) no. 2, pp. 125-145. http://www.numdam.org/item/ITA_1991__25_2_125_0/

1. J. R. Büchi, Weak second-order arithmetic and finite automata, Z. math. Logik Grundlagen Math, 6, 1960, pp. 66-92. | MR | Zbl

2. J. Doner, Tree acceptors and some of their applications, J. of Comp. and System Sci., 4, 1970, pp. 406-451. | MR | Zbl

3. C. C. Elgot, Decision problems of finite automata design and related arithmetics, Trans. Amer, Math. Soc., 98, 1961, pp. 21-52. | MR | Zbl

4. F. Gecseg and M. Steinby, "Tree Automata", Akademiai Kiado, Budapest, 1984. | MR | Zbl

5. U. Heuter, First-order properties of fmite trees, star-free expressions and aperiodicity, Proc. 5th STACS, R. Cori and M. Wirsing, Eds., L.N.C.S., 294, 1988, pp. 136-149. | MR | Zbl

6. U. Heuter, Zur Klassifizierung regulärer Baumsprachen, Dissertation an der RWTH, Aachen, 1989.

7. U. Heuter and D. Niwinski, A note on starfree tree languages (to appear), 1989.

8. R. Mcnaughton and S. Papert, "Counter-free Automata", M.I.T.-Press, Cambridge, Mass., 1971. | MR | Zbl

9. A. R. Meyer, A note on star-free events, J. Assoc. Comput. Mach., 16, 1969, pp. 220-225. | MR | Zbl

10. J. G. Rosenstein, "Linear Orderings", Academic Press, New York, 1982. | MR | Zbl

11. M. P. Schützenberger, On monoids having only nontrivial subgroups, Inform. Contr., 8, 1965, pp. 190-194. | MR | Zbl

12. W. Thomas, Classifying regular events in symbolic logic, J. of Comput. and System Sci, 25, 1982, pp. 360-376. | MR | Zbl

13. W. Thomas, Logical aspects in the study of tree languages, Ninth colloquium on trees in algebra and programming, B. Courcelle Ed., Cambridge Univ. Press, 1984, pp. 31-51. | MR | Zbl

14. J. W. Thatcher and J. B. Wright, Generalized finite automata with an application to a decision problem of second-order logic, Math. Syst Theory, 2, 1968, pp. 57-82. | MR | Zbl