An answer to a question about finite maximal prefix sets of words
From MaRDI portal
Publication:1107641
DOI10.1016/0304-3975(88)90139-9zbMath0653.20061OpenAlexW2031772228MaRDI QIDQ1107641
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90139-9
concatenation productfinite maximal prefix productmaximal prefix setssubsets of free semigroupsunambiguous product
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (2)
About prefix sets of words ⋮ Product of Finite Maximal P-Codes. This paper was supported in part by HK UGC grants 9040596, 9040511 and City U Strategic Grants 7001189, 7001060, and by the Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural Science Foundation (project No. 001174)
Cites Work
This page was built for publication: An answer to a question about finite maximal prefix sets of words
