Pages that link to "Item:Q2708948"
From MaRDI portal
The following pages link to On the decomposition of finite languages (Q2708948):
Displaying 24 items.
- On the computation of quotients and factors of regular languages (Q351995) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- Variants of codes and indecomposable languages (Q1041051) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Inductive synthesis of cover-grammars with the help of ant colony optimization (Q1692068) (← links)
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- Simple equations on binary factorial languages (Q2271433) (← links)
- Canonical decomposition of catenation of factorial languages (Q2466979) (← links)
- Commutation with codes (Q2484442) (← links)
- Prime languages (Q2514149) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- A non-ambiguous language factorization problem (Q2708959) (← links)
- On Language Decompositions and Primality (Q3003471) (← links)
- Finite Orbits of Language Operations (Q3004580) (← links)
- (Q3026364) (← links)
- Length Codes, Products of Languages and Primality (Q3540138) (← links)
- An algorithm for the decomposition of finite languages (Q3577905) (← links)
- Language Decompositions, Primality, and Trajectory-Based Operations (Q3602796) (← links)
- (Q3694723) (← links)
- (Q3714484) (← links)
- Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen (Q3773932) (← links)
- Fundamentals of Computation Theory (Q5900813) (← links)
