On Definability of Universal Graphic Automata by Their Input Symbol Semigroups
From MaRDI portal
Publication:5122693
DOI10.18500/1816-9791-2020-20-1-42-50zbMath1478.68185OpenAlexW3011538100MaRDI QIDQ5122693
V. A. Molchanov, R. A. Farakhutdinov
Publication date: 23 September 2020
Published in: Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/isu827
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Categories of machines, automata (18B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semigroups of mappings on graphs
- A universal planar automaton is determined by its semigroup of input symbols
- Elementary equivalence of derivative structures of free lattices
- Ordered sets and their inf-endomorphisms
- Elementary Equivalence of Derived Structures of Free Semigroups, Unars, and Groups
- Endomorphism rings of modules and lattices of submodules