Abstract
AbstractThe sets of all maximum subclasses in classes of linear automata over finite fields are found. An algorithm that decides completeness of finite subsets based on maximum subclasses is formulated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
