Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q632211 |
Created claim: Wikidata QID (P12): Q62049409, #quickstatements; #temporary_batch_1712190744730 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Dao Wen Qiu / rank | |||
Normal 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.1016/j.fss.2012.03.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024250534 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62049409 / rank | |||
Normal rank | |||
Revision as of 02:44, 4 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automata theory based on complete residuated lattice-valued logic: Turing machines |
scientific article |
Statements
Automata theory based on complete residuated lattice-valued logic: Turing machines (English)
0 references
29 November 2012
0 references
nonclassical logic
0 references
residuated lattices
0 references
Turing machines
0 references
recursively enumerable languages
0 references
universal Turing machines
0 references
