Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Sequential Automatic Algebras
verfasst von : Michael Brough, Bakhadyr Khoussainov, Peter Nelson
Erschienen in: Logic and Theory of Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A
sequential automatic algebra
is a structure of the type (
A
;
f
1
,...,
f
n
), where
A
is recognised by a finite automaton, and functions
f
1
, ...,
f
n
are total operations on
A
that are computed by input-output automata. Our input-output automata are variations of Mealy automata. We study some of the fundamental properties of these algebras and provide many examples. We give classification results for certain classes of groups, Boolean algebras, and linear orders. We also introduce different classes of sequential automatic algebras and give separating examples. We investigate linear orders considered as sequential automatic algebras. Finally, we outline some of the basic properties of sequential automatic unary algebras.