scientific article; zbMATH DE number 7260573

zbMATH Open1444.68098MaRDI QIDQ4970172FDOQ4970172

N. Mohana, Kalyani Desikan

Publication date: 14 October 2020

Full work available at URL: http://ijmcs.future-in-tech.net/15.4/R-Mohana.pdf

Title of this publication is not available (Why is that?)

zbMATH Keywords

parallelisable string-based SP-languageparallelisable string-based SP-regular grammar

Mathematics Subject Classification ID

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

Cited In (1)

• SP/1--A FORTRAN integrated string processor

Recommendations

• Series-parallel languages and the bounded-width property 👍 👎
• Aspects of Molecular Computing 👍 👎
• Splicing representations of stricly locally testable languages 👍 👎
• PARALLEL CONTEXTUAL ARRAY GRAMMARS AND LANGUAGES 👍 👎
• Maximally Parallel Contextual String Rewriting 👍 👎
• On the Parallelizability of Languages Accepted by P Automata 👍 👎
• Variants of Distributed P Automata and the Efficient Parallelizability of Languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4970172)