A universal planar automaton is determined by its semigroup of input symbols

DOI10.1007/S00233-010-9256-8zbMATH Open1211.68260OpenAlexW2057628399MaRDI QIDQ633181FDOQ633181

Authors: V. A. Molchanov 

Publication date: 31 March 2011

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-010-9256-8

Recommendations

• Concrete characterization of universal planar automata
• Abstract Characterization of Semigroups of Input Signals of Universal Planar Automata
• Representation of universal planar automata by autonomous input signals
• Elementary definability of the class of universal planar automata in the class of semigroups
• On definability of universal graphic automata by their input symbol semigroups

zbMATH Keywords

automatonsemigroupaffine and projective planes

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• The structure of isomorphisms of universal hypergraphical automata
• Abstract Characterization of Semigroups of Input Signals of Universal Planar Automata
• On definability of universal graphic automata by their input symbol semigroups
• Elementary definability of the class of universal planar automata in the class of semigroups
• Researches of semigroups with planar Cayley graphs: results and problems
• Representation of universal planar automata by autonomous input signals
• Concrete characterization of universal planar automata

This page was built for publication: A universal planar automaton is determined by its semigroup of input symbols

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