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

DOI10.1016/S0304-3975(00)00192-4zbMath0983.68086MaRDI QIDQ5958121

Zoltán Fülöp, G. Dányi

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

cooperating grammar systemsregular tree grammarstree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited

Cites Work

• Cooperating distributed hyperedge replacement grammars
• Generalized sequential machine maps
• Bottom-up and top-down tree transformations— a comparison
• Grammar systems: A grammatical approach to distribution and cooperation
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Tree generating regular systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The component hierarchy of chain-free cooperating distributed regular tree grammars