Deciding Equivalence of Finite Tree Automata (Q3477969): 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.1137/0219027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019789808 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding Equivalence of Finite Tree Automata |
scientific article |
Statements
Deciding Equivalence of Finite Tree Automata (English)
0 references
1990
0 references
complexity
0 references
semirings
0 references
equivalence
0 references
finite tree automata
0 references
ambiguity
0 references
