Amalgamated free product in terms of automata constructions

Autor:	V. A. Prokhorchuk, Andriy Oliynyk
Rok vydání:	2021
Předmět:	Discrete mathematics Algebra and Number Theory Finite-state machine Free product Cyclic group Residually finite group Alphabet Nonlinear Sciences::Cellular Automata and Lattice Gases Finite set Computer Science::Formal Languages and Automata Theory Automaton Mathematics
Zdroj:	Communications in Algebra. 50:740-750
ISSN:	1532-4125 0092-7872
DOI:	10.1080/00927872.2021.1967965
Popis:	Automata over finite alphabet are considered. Initial automata over finite alphabet with 4 states generating amalgamated free products of finite number of finite cyclic groups are constructed.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::6afe6eee9412ffdf42ac57bc65d29206 https://doi.org/10.1080/00927872.2021.1967965 Zobrazit plný text záznamu