On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Dmitriĭ Nikolaevich Babin / rank | |||
| Property / author | |||
| Property / author: Dmitriĭ Nikolaevich Babin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems |
scientific article |
Statements
On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (English)
0 references
28 January 2001
0 references
decidable completeness problem
0 references
Post class
0 references
automaton functions
0 references
