On path equivalence of nondeterministic finite automata (Q1351166): 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/0020-0190(96)00039-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012572971 / rank | |||
Normal rank | |||
Revision as of 20:15, 19 March 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
