On the decomposition of finite languages
From MaRDI portal
Recommendations
Cited in
(30)- Variants of codes and indecomposable languages
- A new algorithm for regularizing one-letter context-free grammars.
- Inductive synthesis of cover-grammars with the help of ant colony optimization
- A non-ambiguous decomposition of regular languages and factorizing codes
- Simple equations on binary factorial languages
- Canonical decomposition of catenation of factorial languages
- Commutation with codes
- Prime languages
- Decidability of trajectory-based equations
- A non-ambiguous language factorization problem
- Prime languages
- Regular languages of plus- and minus-(in)decomposable permutations
- On language decompositions and primality
- Finite Orbits of Language Operations
- scientific article; zbMATH DE number 4014051 (Why is no real title available?)
- On the computation of quotients and factors of regular languages
- Length Codes, Products of Languages and Primality
- An algorithm for the decomposition of finite languages
- Language Decompositions, Primality, and Trajectory-Based Operations
- Prime Decompositions of Regular Languages
- scientific article; zbMATH DE number 3919851 (Why is no real title available?)
- scientific article; zbMATH DE number 3943060 (Why is no real title available?)
- Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen
- scientific article; zbMATH DE number 2040895 (Why is no real title available?)
- Unique decomposition of homogeneous languages and application to isothetic regions
- scientific article; zbMATH DE number 2162119 (Why is no real title available?)
- A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
- Fundamentals of Computation Theory
- Language equations with complementation: expressive power
- On the existence of prime decompositions
This page was built for publication: On the decomposition of finite languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708948)
