You are here: Home :: Area NEM :: Mathematics

D. N. Babin

Efficient recognition of completeness of systems of automaton functions with complete Boolean part

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.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 13, 05/2003
Pages: 63 - 84

Show full article (external site)

Show all available items of this journal

 

Area NEM