Some properties of P-sets of finite-automaton functions

DOI10.3103/S0027132213010151zbMATH Open1283.03048OpenAlexW2464356932MaRDI QIDQ355349FDOQ355349

Authors: Alexander Rodin 

Publication date: 24 July 2013

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

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

Recommendations

• The completeness criterion for some systems containing \(P\)-sets of automaton functions
• scientific article; zbMATH DE number 468641
• scientific article; zbMATH DE number 5005932
• The completeness criterion for systems which contain all one-place finite-automaton functions
• scientific article; zbMATH DE number 3898772

zbMATH Keywords

precomplete classes\(k\)-valued logicfinite-automaton functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Many-valued logic (03B50)

Cites Work

• On Slupecki classes for automaton functions
• The completeness criterion for systems which contain all one-place finite-automaton functions

Cited In (5)

• The completeness criterion for some systems containing \(P\)-sets of automaton functions
• On Slupecki classes for automaton functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional aspects of the completeness problem for some classes of automaton functions

This page was built for publication: Some properties of \(P\)-sets of finite-automaton functions

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