Abstract
In this paper we characterize all permutation automata which can be linearly realized over the field GF(p) in terms of the group generated by the automaton. From this group theoretic characterization of linear permutation automata we derive, among other results, a complete characterization of all homomorphisms of a linear automaton which yield linearly realizable image automata as well as several results about the structure of linear automata.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
