Homing vector automata
From MaRDI portal
Publication:2969985
DOI10.1051/ITA/2016017zbMATH Open1362.68154arXiv1603.09185OpenAlexW2962773321MaRDI QIDQ2969985FDOQ2969985
Authors: Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro 
Publication date: 24 March 2017
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1603.09185
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Remarks on blind and partially blind one-way multicounter machines
- Formal Languages and Groups as Memory
- Counter machines and counter languages
- Generalized Automata and Stochastic Languages
- A multidimensional continued fraction generalization of Stern's diatomic sequence
- Finite automata over free groups
- Extended finite automata over groups
- Finite automata with multiplication
- Quantum algorithms via linear algebra. A primer
- Simulations by time-bounded counter machines
- EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
- Real-time vector automata
Cited In (2)
This page was built for publication: Homing vector automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969985)
