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.
Farid M. Ablayev. On Complexity of Regular (1,+k)-Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), (44), 1999. [doi]
Abstract is missing.