The generative capacity of block-synchronized context-free grammars

DOI10.1016/J.TCS.2004.11.003zbMath1078.68065OpenAlexW1994084299MaRDI QIDQ557813

Ian McQuillan

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.003

zbMATH Keywords

synchronizationrewriting systemsET0L languagesindexed languages

Mathematics Subject Classification ID

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

Related Items (3)

Vanishing cycles in holomorphic foliations by curves and foliated shells ⋮ An infinite hierarchy induced by depth synchronization ⋮ On the synchronized derivation depth of context-free grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of synchronization in parallel computations
• Synchronized tree automata
• Deterministic versus nondeterministic space in terms of synchronized alternating machines
• Stack Machines and Classes of Nonnested Macro Languages
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: The generative capacity of block-synchronized context-free grammars