THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS

DOI10.1142/S0218196792000050zbMATH Open0780.68059OpenAlexW2091013922MaRDI QIDQ4711250FDOQ4711250

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4216027
• scientific article; zbMATH DE number 1254106
• Complexity results on the conjugacy problem for monoids
• Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
• scientific article; zbMATH DE number 4210423
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Developments in Language Theory
• scientific article; zbMATH DE number 1916674
• Computations over finite monoids and their test complexity
• Generic complexity of finitely presented monoids and semigroups

zbMATH Keywords

codereducibilitycompletenessfinite automataTuring machinemonoidregular sets

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• It is decidable whether a monadic thue system is canonical over a regular set

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

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