On problem of concrete characterization of universal automata

DOI10.1134/S1995080217040114zbMath1370.68209OpenAlexW2735792105MaRDI QIDQ2404807

E. V. Khvorostukhina, V. A. Molchanov

Publication date: 20 September 2017

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080217040114

zbMATH Keywords

hypergraphsemigroupautomatonconcrete characterization

Mathematics Subject Classification ID

Hypergraphs (05C65) Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (1)

Abstract characterization of input symbol semigroups of universal hypergraphic automata

Cites Work

• Endomorphism semigroups for weak \(p\)-hypergraphs
• Topics in universal algebra
• HYPERGRAPHS
• Unnamed Item
• Unnamed Item

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