Trading independent for synchronized parallelism in finite copying parallel rewriting systems

DOI10.1006/jcss.1997.1515zbMath0916.68085OpenAlexW2013728008MaRDI QIDQ1267708

Giorgio Satta

Publication date: 8 December 1998

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1515

zbMATH Keywords

finite copying parallel rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree transducers, L systems, and two-way machines
• The string generating power of context-free hypergraph grammars
• On multiple context-free grammars
• Parallel concepts in graph theory
• Independent parallelism in finite copying parallel rewriting systems
• A note on scattered context grammars
• Graph expressions and graph rewritings
• Substitutions dans les EDT0L systèmes ultralinéaires
• On ETOL systems of finite index
• Translations on a context free grammar
• Some restrictive devices for context-free grammars

This page was built for publication: Trading independent for synchronized parallelism in finite copying parallel rewriting systems