Group Input Machine

Authors:
Ruslans Tarasovs;Rūsiņš Freivalds
Affiliations:
Department of Computer Science, University of Latvia, Riga, Latvia;Department of Computer Science, University of Latvia, Riga, Latvia
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 3
Cited 0

A lower bound for probabilistic algorithms for finite state machines

Journal of Computer and System Sciences
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new type of internal memory for finite automata and real-time automata. Instead of using tapes with a prescribed Euclidean structure (one-dimensional or two-dimensional tapes) we allow arbitrary group structure of the internal memory of the automata.