RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive
Diskr. Mat., 2003 Volume 15, Issue 1, Pages 110–130 (Mi dm188)
This article is cited in 1 paper

Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part

D. N. Babin


Abstract: We consider automaton bases with complete Boolean part. We construct an algorithm to test completeness of such bases and give upper bounds for its complexity.

UDC: 519.7

Received: 11.10.2002

DOI: 10.4213/dm188


 English version: Discrete Mathematics and Applications, 2003, 13:1, 63–84

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024