Equivalence problem of non-deterministic finite automata (Q1255319): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(79)90048-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998090528 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5681000 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079524 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiple-entry finite automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3239817 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equivalence problem of non-deterministic finite automata / rank | |||
Normal rank | |||
Latest revision as of 00:38, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence problem of non-deterministic finite automata |
scientific article |
Statements
Equivalence problem of non-deterministic finite automata (English)
0 references
1979
0 references
Equivalence Problem of Nondeterministic Finite Automata
0 references
Complexity
0 references
