Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups

Saved in:
Bibliographic Details
Published in:Lobachevskii Journal of Mathematics
Format: Online Article RSS Article
Published: 2025
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030189676134402
collection WordPress RSS
FRELIP Feed Integration
container_title Lobachevskii Journal of Mathematics
description
discipline_display Natural Sciences
discipline_facet Natural Sciences
format Online Article
RSS Article
genre Journal Article
id rss_article:17301
institution FRELIP
journal_source_facet Lobachevskii Journal of Mathematics
publishDate 2025
publishDateSort 2025
record_format rss_article
spellingShingle Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
Mathematics
Natural Sciences — Mathematical Sciences
Natural Sciences
sub_discipline_display Natural Sciences — Mathematical Sciences
sub_discipline_facet Natural Sciences — Mathematical Sciences
subject_display Mathematics
Natural Sciences — Mathematical Sciences
Natural Sciences
Mathematics
Natural Sciences — Mathematical Sciences
Natural Sciences
subject_facet Mathematics
Natural Sciences — Mathematical Sciences
Natural Sciences
title Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
title_auth Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
title_full Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
title_fullStr Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
title_full_unstemmed Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
title_short Relatively Elementary Definability of the Class of Universal Partial Graphic Semiautomata over Nontrivial Reflexive Graphs in the Class of Semigroups
title_sort relatively elementary definability of the class of universal partial graphic semiautomata over nontrivial reflexive graphs in the class of semigroups
topic Mathematics
Natural Sciences — Mathematical Sciences
Natural Sciences
url https://link.springer.com/article/10.1134/S199508022561392X