Pages that link to "Item:Q2708959"
From MaRDI portal
The following pages link to A non-ambiguous language factorization problem (Q2708959):
Displaying 6 items.
- On some factorization problems (Q1280223) (← links)
- Some combinatorial results on Bernoulli sets and codes (Q1605333) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- Regular component decomposition of regular languages. (Q1874420) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- An algorithm for the decomposition of finite languages (Q3577905) (← links)