RAIRO-Theor. Inf. Appl.
Volume 50, Number 4, October-December 20167th Non-Classical Models of Automata and Applications (NCMA-2015)
|Page(s)||371 - 386|
|Published online||21 October 2016|
Homing vector automata∗
1 Boǧaziçi University, Department of Computer Engineering,
Bebek 34342, Istanbul, Turkey.
2 Boğaziçi University, Department of Mathematics, Bebek 34342, Istanbul, Turkey.
3 Università di Roma “La Sapienza”, Dipartimento di Matematica, Piazzale Aldo Moro 2, 00185 Roma, Italy.
Accepted: 8 August 2016
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept the input. The computational power and properties of deterministic, nondeterministic, blind, non-blind, real-time and one-way versions of these machines are examined and compared to various related types of automata. A generalized version of the Stern−Brocot encoding method, suitable for representing strings on arbitrary alphabets, is also developed.
Mathematics Subject Classification: 68Q45 / 68Q05
Key words: Vector automata / group automata / Stern−Brocot
© EDP Sciences 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.