@inproceedings{52e3a20a3fa24769a47a706338e04e8f,
title = "Representation of autonomous automata",
abstract = "An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of partial transformations together with its generating set, and in this case success occurs only with autonomous automata.",
author = "Jānis Buls and Vaira Bu{\v z}a and Roberts Glaudiņ{\v s}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 13th International Symposium on Fundamentals of Computation Theory, FCT 2001 ; Conference date: 22-08-2001 Through 24-08-2001",
year = "2001",
doi = "10.1007/3-540-44669-9\_35",
language = "English",
isbn = "9783540446699",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "372--375",
editor = "Rusins Freivalds",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}