Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 567717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bottom-up tree pushdown automata: Classification and connection with rewrite systems |
scientific article; zbMATH DE number 567717 |
Statements
Bottom-up tree pushdown automata: Classification and connection with rewrite systems (English)
0 references
15 May 1994
0 references
bottom-up tree pushdown automata
0 references
rewrite systems
0 references
decidability
0 references
ground reducibility
0 references
recognizability
0 references
0 references
0.9586738348007202
0 references
0.8239889144897461
0 references
0.7687826752662659
0 references
0.7619177103042603
0 references
0.759468138217926
0 references
