On the complexity of minimum inference of regular sets (Q4174776): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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/s0019-9958(78)90683-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018706164 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:23, 30 July 2024
scientific article; zbMATH DE number 3610752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimum inference of regular sets |
scientific article; zbMATH DE number 3610752 |
Statements
On the complexity of minimum inference of regular sets (English)
0 references
1978
0 references
Stochastic Automata
0 references
Regular Sets
0 references
Complexity
0 references
Polynomial Time Algorithm
0 references
Inference
0 references
Np-Hard
0 references
Np-Complete
0 references
