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.
Cite
CITATION STYLE
APA
Caucal, D., & Knapik, T. (2002). A chomsky-like hierarchy of infinite graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2420, pp. 177–187). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free