Pages that link to "Item:Q1912449"
From MaRDI portal
The following pages link to Algorithmic ways of deciding whether an infinite language is a code (Q1912449):
Displaying 16 items.
- Languages with membership determined by single letter factors (Q529064) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- L codes and number systems (Q788495) (← links)
- Some algorithms on the star operation applied to finite languages (Q794778) (← links)
- A characterization of s-languages (Q1029050) (← links)
- The structure of generalized code chains (Q1034388) (← links)
- Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson (Q1063697) (← links)
- The base of the intersection of two free submonoids (Q1070043) (← links)
- 2-codes and 2-code annihilators (Q1375906) (← links)
- Codes induced by alternative codes (Q1752957) (← links)
- Anti-commutative languages and n-codes (Q1823000) (← links)
- Compatibility relations on codes and free monoids (Q3526416) (← links)
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets (Q3547014) (← links)
- On infinitary finite length codes (Q3765256) (← links)
- A property of biprefix codes (Q3793748) (← links)
- It is decidable whether or not a permutation-free morphism is an l code (Q4734778) (← links)