The complexity of restricted regular expressions and the synthesis problem for finite automata
From MaRDI portal
Publication:1052825
DOI10.1016/0022-0000(81)90070-2zbMath0516.68051MaRDI QIDQ1052825
Publication date: 1981
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(81)90070-2
68Q45: Formal languages and automata
Related Items
From regular expressions to finite automata∗, One-unambiguous regular languages, One-unambiguous regular languages, The validation of SGML content models