scientific article
From MaRDI portal
Publication:3742751
zbMath0605.68077MaRDI QIDQ3742751
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel algorithmsmodels of parallel computationcube-connected computercomplexity of context-free recognitiondeterministic pdaperfect-shuffle computer
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Boolean grammars ⋮ Optimal parallel parsing of bracket languages ⋮ Parallel parsing of programming languages ⋮ On the complexity of parallel parsing of general context-free languages ⋮ On efficient parallel computations for some dynamic programming problems ⋮ Parallel recognition and ranking of context-free languages ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Linear-space recognition for grammars with contexts ⋮ Fast recognition of deterministic cfl's with a smaller number of processors ⋮ The hardest linear conjunctive language ⋮ Effective entropies and data compression ⋮ Optimal parallel algorithms for dynamic expression evaluation and context-free recognition ⋮ Unnamed Item ⋮ Parallel on-line parsing in constant time per word
This page was built for publication:
