Grammar Systems as Language Analyzers and Recursively Enumerable Languages - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Henning Bordihn, Jürgen Dassow, György Vaszil. Grammar Systems as Language Analyzers and Recursively Enumerable Languages. In Gabriel Ciobanu, Gheorghe Paun, editors, Fundamentals of Computation Theory, 12th International Symposium, FCT 99, Iasi, Romania, August 30 - September 3, 1999, Proceedings. Volume 1684 of Lecture Notes in Computer Science, pages 136-147, Springer, 1999. [doi]

The following publications are possibly variants of this publication:

Parallel Communicating Grammar Systems As Language AnalyzersHenning Bordihn, Jürgen Dassow, György Vaszil. grammars, 3(1):1-20, 2000.

PC grammar systems with five context-free components generate all recursively enumerable languagesErzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil. TCS, 1-3(299):785-794, 2003. [doi]

Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free ComponentsGyörgy Vaszil. jalc, 12(1-2):307-315, 2007.

Scattered context grammars generate any recursively enumerable language with two nonterminalsErzsébet Csuhaj-Varjú, György Vaszil. ipl, 110(20):902-907, 2010. [doi]

runs on WebDSL