Solvability of the problem of completeness of automaton basis depending on its Boolean part
From MaRDI portal
(Redirected from Publication:2319977)
Recommendations
- scientific article; zbMATH DE number 2032360
- Finiteness of the set of automaton Post bases with solvable completeness problem
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
- scientific article; zbMATH DE number 468641
Cites work
- Completeness conditions for finite automata
- scientific article; zbMATH DE number 3976344 (Why is no real title available?)
- scientific article; zbMATH DE number 468641 (Why is no real title available?)
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
Cited in
(8)- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- scientific article; zbMATH DE number 5005932 (Why is no real title available?)
- scientific article; zbMATH DE number 3988715 (Why is no real title available?)
- scientific article; zbMATH DE number 468641 (Why is no real title available?)
- scientific article; zbMATH DE number 2032360 (Why is no real title available?)
- Finiteness of the set of automaton Post bases with solvable completeness problem
- scientific article; zbMATH DE number 3219607 (Why is no real title available?)
- Statistical estimation of the structure of a finite population
This page was built for publication: Solvability of the problem of completeness of automaton basis depending on its Boolean part
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319977)
