On decidability of the completeness problem for special systems of automaton functions (Q3125966): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1515/dma.1996.6.5.491 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/dma.1996.6.5.491 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094857677 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA.1996.6.5.491 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:57, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On decidability of the completeness problem for special systems of automaton functions |
scientific article |
Statements
On decidability of the completeness problem for special systems of automaton functions (English)
0 references
23 March 1997
0 references
automaton functions
0 references
Post class
0 references
completeness problem
0 references
\(A\)-completeness problem
0 references
algorithmic decidability
0 references
