On group automata over finite fields

Authors:
A. V. Kelarev
Affiliations:
Mathematics and Physics, Faculty of Science and Engineering, University of Tasmania, Private Bag 37, Hobart, Tasmania 7001, Australia
Venue:
Finite Fields and Their Applications
Year:
2004

Citing 3
Cited 2

Handbook of Formal Languages

Handbook of Formal Languages
Algebraic Structures in Automata and Database Theory

Algebraic Structures in Automata and Database Theory
On congruences of automata defined by directed graphs

Theoretical Computer Science

An Algorithm for BCH Codes Extended with Finite State Automata

Fundamenta Informaticae - Workshop on Combinatorial Algorithms
An Algorithm for BCH Codes Extended with Finite State Automata

Fundamenta Informaticae - Workshop on Combinatorial Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the structure of incidence rings of group automata over finite fields. One of the major tools used in research on the structure of ring constructions is the Jacobson radical. Our main theorem gives a complete description of the Jacobson radicals of incidence rings of (possibly nondeterministic) group automata over finite fields in the important special case where the input group is abelian.