On problem of abstract definability of universal hypergraphic automata by input symbol semigroup

zbMATH Open1437.68126MaRDI QIDQ5110064FDOQ5110064

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

Publication date: 15 May 2020

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

Recommendations

• On problem of abstract characterization of universal hypergraphic automata
• Abstract characterization of input symbol semigroups of universal hypergraphic automata
• On definability of universal graphic automata by their input symbol semigroups
• On a concrete characterization problem of universal graphic semiautomata
• The structure of isomorphisms of universal hypergraphical automata

zbMATH Keywords

automatonsemigrouphypergraphproblem of abstract definability

Mathematics Subject Classification ID

Hypergraphs (05C65) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (8)

• The structure of isomorphisms of universal hypergraphical automata
• Abstract Characterization of Semigroups of Input Signals of Universal Planar Automata
• 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
• Elementary definability of the class of universal hypergraphic automata in the class of semigroups
• On a concrete characterization problem of universal graphic semiautomata
• On epimorphisms of input symbol semigroups, of universal hypergraphic automata
• Abstract characterization of input symbol semigroups of universal hypergraphic automata

This page was built for publication: On problem of abstract definability of universal hypergraphic automata by input symbol semigroup

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