EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 2 (1991) RAIRO-Theor. Inf. Appl., 25 2 (1991) 125-145 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 2, 1991
Page(s) 125 - 145
DOI https://doi.org/10.1051/ita/1991250201251
Published online 01 February 2017
  1. 1. J. R. BÜCHI, Weak second-order arithmetic and finite automata, Z. math. Logik Grundlagen Math, 6, 1960, pp. 66-92. [MR: 125010] [Zbl: 0103.24705] [Google Scholar]
  2. 2. J. DONER, Tree acceptors and some of their applications, J. of Comp. and System Sci., 4, 1970, pp. 406-451. [MR: 287977] [Zbl: 0212.02901] [Google Scholar]
  3. 3. C. C. ELGOT, Decision problems of finite automata design and related arithmetics, Trans. Amer, Math. Soc., 98, 1961, pp. 21-52. [MR: 139530] [Zbl: 0111.01102] [Google Scholar]
  4. 4. F. GECSEG and M. STEINBY, "Tree Automata", Akademiai Kiado, Budapest, 1984. [MR: 735615] [Zbl: 0537.68056] [Google Scholar]
  5. 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: 935795] [Zbl: 0644.68103] [Google Scholar]
  6. 6. U. HEUTER, Zur Klassifizierung regulärer Baumsprachen, Dissertation an der RWTH, Aachen, 1989. [Google Scholar]
  7. 7. U. HEUTER and D. NIWINSKI, A note on starfree tree languages (to appear), 1989. [Google Scholar]
  8. 8. R. MCNAUGHTON and S. PAPERT, "Counter-free Automata", M.I.T.-Press, Cambridge, Mass., 1971. [MR: 371538] [Zbl: 0232.94024] [Google Scholar]
  9. 9. A. R. MEYER, A note on star-free events, J. Assoc. Comput. Mach., 16, 1969, pp. 220-225. [MR: 238624] [Zbl: 0224.94060] [Google Scholar]
  10. 10. J. G. ROSENSTEIN, "Linear Orderings", Academic Press, New York, 1982. [MR: 662564] [Zbl: 0488.04002] [Google Scholar]
  11. 11. M. P. SCHÜTZENBERGER, On monoids having only nontrivial subgroups, Inform. Contr., 8, 1965, pp. 190-194. [MR: 176883] [Zbl: 0131.02001] [Google Scholar]
  12. 12. W. THOMAS, Classifying regular events in symbolic logic, J. of Comput. and System Sci, 25, 1982, pp. 360-376. [MR: 684265] [Zbl: 0503.68055] [Google Scholar]
  13. 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: 787450] [Zbl: 0557.68051] [Google Scholar]
  14. 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: 224476] [Zbl: 0157.02201] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.