On concrete characterization of universal graphic automata
From MaRDI portal
Publication:2172891
DOI10.1134/S1995080222060233OpenAlexW4285610304MaRDI QIDQ2172891FDOQ2172891
Authors: V. A. Molchanov, R. A. Farakhutdinov 
Publication date: 19 September 2022
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080222060233
Recommendations
- On a concrete characterization problem of universal graphic semiautomata
- On the problem of abstract characterization of universal graphic automata
- On definability of universal graphic automata by their input symbol semigroups
- Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups
- On problem of concrete characterization of universal automata
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elementary equivalence of derivative structures of free lattices
- On definability of universal graphic automata by their input symbol semigroups
- Elementary Equivalence of Derived Structures of Free Semigroups, Unars, and Groups
- Elementary properties of semigroups of transformations of ordered sets
- Endomorphism rings of modules and lattices of submodules
Cited In (4)
This page was built for publication: On concrete characterization of universal graphic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172891)
