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

DOI10.1134/S0037446619060168zbMath1468.68138OpenAlexW3008595751MaRDI QIDQ2186314

Yanyan Li

Publication date: 9 June 2020

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

semigroupelementary definabilityplaneautomatonelementary classification

Mathematics Subject Classification ID

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

Cites Work

• Semigroups of mappings on graphs
• A universal planar automaton is determined by its semigroup of input symbols
• Elementary equivalence of derivative structures of free lattices
• Elementary properties of semigroups of transformations of ordered sets
• Abstract Characterization of Semigroups of Input Signals of Universal Planar Automata
• Elementary Equivalence of Derived Structures of Free Semigroups, Unars, and Groups
• Elementary classification and decidability of theories of derived structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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