The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet

被引：1
|
作者：
Woryna, Adam [1 ]
机构：
[1] Silesian Tech Univ, Inst Math, Ul Kaszubska 23, PL-44100 Gliwice, Poland
来源：
INFORMATION AND COMPUTATION | 2016年 / 249卷
关键词：
D O I：
10.1016/j.ic.2016.02.004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
For every natural number n, we classify abelian groups generated by an n-state time-varying automaton over the binary alphabet, as well as by an n-state Mealy automaton over the binary alphabet. (C) 2016 Elsevier Inc. All rights reserved.
引用
下载
收藏
页码：18 / 27
页数：10
相关论文
共 38 条
1234