On path equivalence of nondeterministic finite automata (Q1351166): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:08, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On path equivalence of nondeterministic finite automata |
scientific article |
Statements
On path equivalence of nondeterministic finite automata (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Computational complexity
0 references
Path equivalence
0 references
Automaton
0 references
