Parallel complexity of the regular code problem

DOI10.1016/0890-5401(90)90028-GzbMath0699.68071OpenAlexW2067921690MaRDI QIDQ913513

Bruce Litow

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90028-g

zbMATH Keywords

computational complexityparallel computationregular languagesregular code problemregular free monoid problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Decidability of code properties

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• On uniform circuit complexity
• Improved processor bounds for combinatorial problems in RNC
• A taxonomy of problems with fast parallel algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel complexity of the regular code problem