THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS

DOI10.1142/S0218196792000050zbMath0780.68059OpenAlexW2091013922MaRDI QIDQ4711250

Dung T. Huynh

Publication date: 25 June 1992

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196792000050

zbMATH Keywords

reducibilitycompletenessfinite automatacodeTuring machinemonoidregular sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

This page was built for publication: THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS