EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES

DOI10.1142/S0129054191000121zbMath0746.68050OpenAlexW2164778559MaRDI QIDQ4007851

Dung T. Huynh

Publication date: 27 September 1992

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

detectorTuring machinesautomatacircuitsconstructor

Mathematics Subject Classification ID

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

Related Items

How hard is to compute the edit distance ⋮ On languages accepted with simultaneous complexity bounds and their ranking problem ⋮ On the effective generation of set elements within specified ranges ⋮ The complexity of computing maximal word functions