Some properties of \(P\)-sets of finite-automaton functions

DOI10.3103/S0027132213010151zbMath1283.03048OpenAlexW2464356932MaRDI QIDQ355349

A. A. 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

zbMATH Keywords

\(k\)-valued logicprecomplete classesfinite-automaton functions

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

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

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