Regular languages, unambiguous concatenation and computational complexity
From MaRDI portal
Recommendations
Cited in
(7)- The Complexity of Languages Resulting from the Concatenation Operation
- Concatenation of Regular Languages and Descriptional Complexity
- A Similarity Measure for Cyclic Unary Regular Languages
- scientific article; zbMATH DE number 6136496 (Why is no real title available?)
- scientific article; zbMATH DE number 1416105 (Why is no real title available?)
- scientific article; zbMATH DE number 7561705 (Why is no real title available?)
- The complexity of concatenation on deterministic and alternating finite automata
This page was built for publication: Regular languages, unambiguous concatenation and computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465884)