On simple generators of recursively enumerable languages (Q743126): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2014.05.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999654795 / rank | |||
Normal rank | |||
Revision as of 21:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On simple generators of recursively enumerable languages |
scientific article |
Statements
On simple generators of recursively enumerable languages (English)
0 references
22 September 2014
0 references
intersection-closed trio
0 references
r.e. language
0 references
Diophantine equation
0 references
