On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems

From MaRDI portal

Revision as of 02:28, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1594479

Jump to:navigation, search

zbMath0958.03026MaRDI QIDQ1594479

Dmitriĭ Nikolaevich Babin

Publication date: 28 January 2001

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

zbMATH Keywords

automaton functions decidable completeness problem Post class

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (2)

On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata ⋮ Solvability of the problem of completeness of automaton basis depending on its Boolean part

This page was built for publication: On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1594479&oldid=13889370"