Equivalence of deterministic pushdown automata revisited (Q2458041)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence of deterministic pushdown automata revisited |
scientific article; zbMATH DE number 5206869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of deterministic pushdown automata revisited |
scientific article; zbMATH DE number 5206869 |
Statements
Equivalence of deterministic pushdown automata revisited (English)
0 references
31 October 2007
0 references
deterministic pushdown automata
0 references
equivalence problem
0 references
decidability of problems
0 references
deterministic CF language
0 references
0.91152161359787
0 references
0.9067352414131165
0 references
0.8641117215156555
0 references
0.8613725304603577
0 references
