The component hierarchy of chain-free cooperating distributed regular tree grammars

Author： Danyi G.   Fulop Z.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 229-240

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Self-embedded context-free grammars with regular counterparts

By Andrei Stefan   Chin Wei-Ngan   Cavadini Salvador  

Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. : 349-365

Springer Publishing Company

Access to resources Recommend Favorite

Strip tiling and regular grammars

By Merlini D.   Sprugnoli R.   Verri M.C.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 109-124

Elsevier

Access to resources Recommend Favorite

Connectionist learning of regular graph grammars

By Fletcher Peter  

Connection Science, Vol. 13, Iss. 2, 2001-06 ,pp. : 127-188

Taylor & Francis Ltd

Access to resources Recommend Favorite

Fine hierarchy of regular -languages

By Selivanov V.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 37-59

Elsevier

Access to resources Recommend Favorite

Cooperation in context-free grammars

By Dassow J.   Mitrana V.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 353-361

Elsevier

Access to resources Recommend Favorite