Elementary definability of the class of universal hypergraphic automata in the class of semigroups

DOI10.18500/1816-9791-2022-22-3-293-306OpenAlexW4293548915MaRDI QIDQ5040939FDOQ5040939

Authors: V. A. Molchanov, E. V. Khvorostukhina 

Publication date: 18 October 2022

Published in: Izvestiya of Saratov University. Mathematics. Mechanics. Informatics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/isu943

Recommendations

• Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups
• Elementary definability of the class of universal planar automata in the class of semigroups
• On problem of abstract definability of universal hypergraphic automata by input symbol semigroup
• On definability of universal graphic automata by their input symbol semigroups
• On concrete characterization of universal hypergraphic automata
• Abstract characterization of input symbol semigroups of universal hypergraphic automata
• On epimorphisms of input symbol semigroups, of universal hypergraphic automata
• On problem of abstract characterization of universal hypergraphic automata
• The structure of isomorphisms of universal hypergraphical automata
• On relatively elementary definability of graph classes in the class of semigroups

zbMATH Keywords

automatonsemigrouphypergraphelementary definability

Mathematics Subject Classification ID

Group theory and generalizations (20-XX)

Cited In (3)

• The structure of isomorphisms of universal hypergraphical automata
• Elementary definability of the class of universal planar automata in the class of semigroups
• Abstract characterization of input symbol semigroups of universal hypergraphic automata

This page was built for publication: Elementary definability of the class of universal hypergraphic automata in the class of semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5040939)