Name
Title | ||
|---|---|---|
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. |
Year | Venue | Field |
|---|---|---|
2018 | SLATE | Programming language,Reverse Polish notation,Computer science,Natural language processing,Pushdown automaton,Artificial intelligence |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomás Pecka | 1 | 0 | 1.35 |
| Jan Trávnícek | 2 | 0 | 1.01 |
| Radomír Polách | 3 | 0 | 1.01 |
| Jan Janousek | 4 | 8 | 3.74 |