External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Nearly deterministic automata acceptation of infinite trees and a complexitiy of weak theory of SkS

Andrzej Wlodzimierz Mostowski. Nearly deterministic automata acceptation of infinite trees and a complexitiy of weak theory of SkS. In Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, Lilli, France, 21, 22 et 23 fĂ©vier 1980. pages 54-62, Université de Lille 1, 1980.

Abstract

Abstract is missing.

runs on