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

Adam Woryna

doi:10.1016/j.ic.2016.02.004

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

Adam Woryna

Katedra Matematyki (RMS/RMS1)

Wyniki badań: Wkład do czasopisma › Artykuł › recenzja

1 Cytowanie z bazy Scopus

Abstrakt

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.

Język oryginału	angielski
Strony (od–do)	18-27
Liczba stron	10
Czasopismo	Information and Computation
Tom	249
Identyfikatory DOI	https://doi.org/10.1016/j.ic.2016.02.004
Status publikacji	Opublikowano - 1 sie 2016

Obszary tematyczne ASJC Scopus

Informatyka teoretyczna
Systemy informacyjne
Zastosowania informatyki
Teoria i matematyka obliczeń

Uzyskaj dostęp do dokumentu

10.1016/j.ic.2016.02.004

Inne pliki i linki

Link do publikacji w Scopus

Cytuj to

@article{3977d8d620754dde9b701b7d8b5db965,

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

abstract = "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.",

author = "Adam Woryna",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Inc.",

year = "2016",

month = aug,

day = "1",

doi = "10.1016/j.ic.2016.02.004",

language = "English",

volume = "249",

pages = "18--27",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

}

TY - JOUR

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

AU - Woryna, Adam

PY - 2016/8/1

Y1 - 2016/8/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84975709514

U2 - 10.1016/j.ic.2016.02.004

DO - 10.1016/j.ic.2016.02.004

M3 - Article

AN - SCOPUS:84975709514

SN - 0890-5401

VL - 249

SP - 18

EP - 27

JO - Information and Computation

JF - Information and Computation

ER -

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

Abstrakt

Obszary tematyczne ASJC Scopus

Uzyskaj dostęp do dokumentu

Inne pliki i linki

Fingerprint

Cytuj to