On concrete characterization of universal hypergraphic automata

DOI10.1007/S10958-009-9732-4MaRDI QIDQ2452663zbMATH OpenOpenAlexFDO

Authors E. V. Khvorostukhina

Publication date 4 June 2014

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-009-9732-4

Mathematics Subject Classification ID

Hypergraphs (05C65) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

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

Cites work

• Endomorphism semigroups for weak \(p\)-hypergraphs
• HYPERGRAPHS
• On concrete characterization of universal hypergraphic automata

Cited in

(7)

• Abstract characterization of input symbol semigroups of universal hypergraphic automata
• On problem of concrete characterization of universal automata
• The structure of isomorphisms of universal hypergraphical automata
• On concrete characterization of universal hypergraphic automata
• On problem of abstract characterization of universal hypergraphic automata
• Uniformity for the decidability of hybrid automata
• Elementary definability of the class of universal hypergraphic automata in the class of semigroups

This page was built for publication: On concrete characterization of universal hypergraphic automata

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