Name
Abstract | ||
|---|---|---|
We consider a strict four-level hierarchy of graphs closely related to the Chomsky hierarchy of formal languages. We provide a uniform presentation of the four families by means of string rewriting. |
Year | Venue | Keywords |
|---|---|---|
2002 | MFCS | strict four-level hierarchy,chomsky hierarchy,infinite graphs,formal language,uniform presentation,chomsky-like hierarchy |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Formal language,Analytical hierarchy,Chomsky hierarchy,Arithmetical hierarchy,Rewriting,Hierarchy,Grzegorczyk hierarchy,Mathematics,Fast-growing hierarchy | Conference | 2420 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-44040-2 | 5 |
PageRank | References | Authors |
0.53 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Caucal | 1 | 470 | 39.15 |
| Teodor Knapik | 2 | 222 | 16.13 |