A criterion for the decidability of the \(A\)-completeness problem for definite automata

DOI10.1134/S1064562411040065zbMath1244.68049MaRDI QIDQ656372

Dmitriy N. Zhuk

Publication date: 17 January 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean functionsmonadic second-order logicautomatic structuresalgorithmic decidabilitypush-down machinesA-completenessdefinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: A criterion for the decidability of the \(A\)-completeness problem for definite automata