Outfix and infix codes and related classes of languages
From MaRDI portal
(Redirected from Publication:1186552)
Cites work
- scientific article; zbMATH DE number 3854451 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3987346 (Why is no real title available?)
- scientific article; zbMATH DE number 4039328 (Why is no real title available?)
- scientific article; zbMATH DE number 4051030 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 3566726 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- n-Prefix–suffix languages∗
- Anti-commutative languages and n-codes
- E-convex infix codes
- Homomorphisms and subdirect decompositions of semigroups
- Hypercodes, Right Convex Languages and their Syntactic Monoids
- Ordered catenation and regular free disjunctive languages
- Reflective star languages and codes
- Semaphore Codes and Ideals
Cited in
(22)- Some combinatorial properties of solid codes
- Right \(k\)-dense languages
- Automata for solid codes
- Structure of 3-infix-outfix maximal codes.
- The syntactic monoid of hairpin-free languages
- On codes defined by bio-operations
- On some factorizations of infinite words by elements of codes
- Representing recursively enumerable languages by iterated deletion
- Brick codes: families, properties, relations
- Some results on \((k, m)\)-comma codes
- Languages whose \(n\)-element subsets are codes
- Overlap-free languages and solid codes
- A note on autodense related languages
- K-catenation and applications:k-prefix codes
- On group codes
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- Congruences, infix and cohesive prefix codes
- 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)
- Out subword-free languages and its subclasses
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- \(k\)-p-infix codes and semaphore codes
This page was built for publication: Outfix and infix codes and related classes of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186552)
