Name
Abstract | ||
|---|---|---|
We saw (in section 1) that we can transform every pushdown automaton into a graph grammar generating its transition graph. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-53832-1_51 | WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science |
Keywords | Field | DocType |
transition graph | Deterministic context-free grammar,Tree-adjoining grammar,Context-sensitive grammar,Discrete mathematics,Embedded pushdown automaton,Combinatorics,Line graph,Computer science,Pushdown automaton,Symmetric graph,Pathwidth | Conference |
Volume | ISSN | ISBN |
484 | 0302-9743 | 0-387-53832-1 |
Citations | PageRank | References |
19 | 3.00 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Caucal | 1 | 470 | 39.15 |
| Roland Monfort | 2 | 19 | 3.00 |