The completeness criterion for systems which contain all one-place finite-automaton functions

DOI10.1515/dma.2000.10.6.613zbMath1088.68631OpenAlexW2032538897MaRDI QIDQ4809508

V. A. Buevich

Publication date: 30 August 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2000.10.6.613

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: The completeness criterion for systems which contain all one-place finite-automaton functions