An answer to a question about finite maximal prefix sets of words

DOI10.1016/0304-3975(88)90139-9zbMATH Open0653.20061OpenAlexW2031772228MaRDI QIDQ1107641FDOQ1107641

Authors: Véronique Bruyère 

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

Recommendations

• About prefix sets of words
• scientific article; zbMATH DE number 4060747
• Maximal prefix products
• Factorization of prefix-closed subsets of words
• Publication:3476744

zbMATH Keywords

concatenation productfinite maximal prefix productmaximal prefix setssubsets of free semigroupsunambiguous product

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Sur certains sous-monoïdes libres
• On a question concerning certain free submonoids
• Maximal prefix products

Cited In (5)

• 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)
• Title not available (Why is that?)
• Maximal prefix products
• About prefix sets of words
• Factorization of prefix-closed subsets of words

This page was built for publication: An answer to a question about finite maximal prefix sets of words

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