Equivalence problem for finitely ambiguous finite automata over semigroups (Q3904054): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4168600 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A variant of a recursively unsolvable problem / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01068891 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964678066 / rank | |||
Normal rank | |||
Latest revision as of 12:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence problem for finitely ambiguous finite automata over semigroups |
scientific article |
Statements
Equivalence problem for finitely ambiguous finite automata over semigroups (English)
0 references
1979
0 references
algorithmic solvability
0 references
