On automaton presentations of projective planes

DOI10.1134/S0037446614010078zbMATH Open1404.51004OpenAlexW2058658691MaRDI QIDQ467658FDOQ467658

Authors: A. S. Denisenko, N. T. Kogabaev 

Publication date: 4 November 2014

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

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

Recommendations

• Constructively presented projective planes
• Computable dimensions of Pappusian and Desarguesian projective planes
• scientific article
• Noncomputability of classes of Pappian and Desarguesian projective planes
• The complexity of the isomorphism problem for computable projective planes

zbMATH Keywords

projective planeDesarguesian projective planePappian projective planeautomatic modelautomatic presentationfreely generated projective plane

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Finite affine and projective planes (geometric aspects) (51E15)

Cites Work

• The isomorphism problem on classes of automatic structures with transitive relations
• Three lectures on automatic structures
• The additive group of the rationals does not have an automatic presentation
• Title not available (Why is that?)
• Automata Presenting Structures: A Survey of the Finite String Case
• Automatic Structures: Richness and Limitations
• Title not available (Why is that?)
• Theory of projective planes
• Homomorphisms of freely generated projective planes
• On freely generated projective planes

This page was built for publication: On automaton presentations of projective planes

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