RUS  ENG
Full version
JOURNALS // Algebra and Discrete Mathematics // Archive
Algebra Discrete Math., 2011 Volume 11, Issue 2, Pages 51–63 (Mi adm10)
This article is cited in 2 papers

RESEARCH ARTICLE

Partial actions and automata

M. Dokuchaeva, B. Novikovb, G. Zholtkevychb

a Instituto de Matemática e Estatística Universidade de São Paulo, Rua do Matão, 1010, CEP 05508-090, São Paulo, SP, Brazil
b Kharkov National University, Svobody sq., 4, 61077, Kharkov, Ukraine

Abstract: We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call “a preautomaton”. We study properties of preautomata and of languages recognized by preautomata.

Keywords: Partial action, monoid, automaton, recognizable language, prefix code.

MSC: 20M30, 20M35, 68Q70

Received: 13.04.2011
Revised: 05.05.2011

Language: English



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024