Pages that link to "Item:Q1186552"
From MaRDI portal
The following pages link to Outfix and infix codes and related classes of languages (Q1186552):
Displaying 22 items.
- On some factorizations of infinite words by elements of codes (Q287095) (← links)
- On group codes (Q671367) (← links)
- On codes defined by bio-operations (Q884441) (← links)
- A note on autodense related languages (Q977173) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- Right \(k\)-dense languages (Q1322582) (← links)
- Congruences, infix and cohesive prefix codes (Q1349710) (← links)
- Structure of 3-infix-outfix maximal codes. (Q1389661) (← links)
- Representing recursively enumerable languages by iterated deletion (Q1826643) (← links)
- Some combinatorial properties of solid codes (Q2065362) (← links)
- Some results on \((k, m)\)-comma codes (Q2196433) (← links)
- Automata for solid codes (Q2235761) (← links)
- The syntactic monoid of hairpin-free languages (Q2641875) (← links)
- OVERLAP-FREE LANGUAGES AND SOLID CODES (Q3173944) (← links)
- 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 (Q4551539) (← links)
- <i>K</i>-catenation and applications:<i>k</i>-prefix codes (Q4718626) (← links)
- Finite Completion of comma-free codes Part 1 (Q4825390) (← links)
- Finite Completion of comma-free codes Part 2 (Q4825391) (← links)
- Brick codes: families, properties, relations (Q4954026) (← links)
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES (Q5291302) (← links)
- Out Subword-Free Languages and Its Subclasses (Q5740527) (← links)
- \(k\)-p-infix codes and semaphore codes (Q5931791) (← links)
