Minimal Union-Free Decompositions of Regular Languages
From MaRDI portal
Publication:3618570
DOI10.1007/978-3-642-00982-2_7zbMath1234.68189OpenAlexW1553962232MaRDI QIDQ3618570
Denis Golomazov, Sergey Afonin
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_7
Related Items (6)
Unnamed Item ⋮ Closure properties and complexity of rational sets of regular languages ⋮ Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages ⋮ Multi-decision diagnosis: decentralized architectures cooperating for diagnosing the presence of faults in discrete event systems ⋮ Union-complexities of Kleene plus operation ⋮ Operational union-complexity
Cites Work
- Unnamed Item
- Representation theorems on regular languages
- The limitedness problem on distance automata: Hashiguchi's method revisited
- Isometries on positive operators of unit norm
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
- On Concatenative Decompositions of Regular Events
- On Decompositions of Regular Events
This page was built for publication: Minimal Union-Free Decompositions of Regular Languages
