Number of labelings of definite automata graphs

DOI10.3103/S0027132222020048OpenAlexW4285103883MaRDI QIDQ2674670

R. A. Ishchenko

Publication date: 14 September 2022

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132222020048

zbMATH Keywords

transition graphdefinite automataautomation diagrammlabelings of automaton graphstructure of automaton graph

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• The labeling graphs of definite automata
• On completeness of the binary boundedly determined functions with respect to superposition
• On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
• Lower Bound of the Number of Threshold Functions
• The Theory of Definite Automata

This page was built for publication: Number of labelings of definite automata graphs