scientific article; zbMATH DE number 978111
From MaRDI portal
zbMATH Open0862.68084MaRDI QIDQ4332299FDOQ4332299
Publication date: 25 May 1997
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- n-Prefix–suffix languages∗
- 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?)
- On the lattice of prefix codes.
- Two classes of languages related to the prefix codes
- Product of maximal prefix codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some free submonoids of the free monoid of prefix codes
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332299)