A Chomsky-Like Hierarchy of Infinite Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Didier Caucal, Teodor Knapik. A Chomsky-Like Hierarchy of Infinite Graphs. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 177-187, Springer, 2002. [doi]

This author has not been identified. Look up 'Didier Caucal' in GoogleThis author has not been identified. Look up 'Teodor Knapik' in Google

runs on WebDSL