Cooperating Distributed Tree Automata

DOI10.1007/978-3-642-31644-9_5zbMath1367.68168OpenAlexW2125375267MaRDI QIDQ3166944

Henning Fernau

Publication date: 1 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

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

Cites Work

• Frontiers of tractability for typechecking simple XML transformations
• Typechecking top-down XML transformations: Fixed input or output schemas
• A geometric hierarchy beyond context-free languages
• Stack cooperation in multistack pushdown automata
• Syntactic structures as multi-dimensional trees
• Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence
• Algorithmic Properties of Millstream Systems
• VARIANTS OF COMPETENCE-BASED DERIVATIONS IN CD GRAMMAR SYSTEMS
• Bag Context Tree Grammars
• On the generating power of regularly controlled bidirectional grammars
• Accepting grammars with regulation
• Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cooperating Distributed Tree Automata