Word Processing in Groups
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
The monadic theory of morphic infinite words and generalizations
Information and Computation
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Automatic Structures: Richness and Limitations
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Automatic presentations for finitely generated groups
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
A sequential automatic algebrais a structure of the type (A; f1,..., fn), where Ais recognised by a finite automaton, and functions f1, ..., fnare total operations on Athat 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.