An Algorithm for Recognizing the Spherical Transitivity of an Initial Binary Automaton |
| |
Authors: | Lipina T. I. |
| |
Affiliation: | 1.Lomonosov Moscow State University, 119991, Moscow, Russia ; |
| |
Abstract: | Mathematical Notes - An algorithm is presented which determines in a finite number of steps whether an initial finite binary automaton is spherically transitive. Since the class of deterministic... |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|