Skip to Main content Skip to Navigation
Conference papers

On Union-Free and Deterministic Union-Free Languages

Abstract : The paper continues the study of union-free and deterministic union-free languages. In contrast with the fact that every regular language can be described as a finite union of union-free languages, we show that the finite unions of deterministic union-free languages define a proper subfamily of regular languages. Then we examine the properties of this subfamily.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-01556208
Contributor : Hal Ifip <>
Submitted on : Tuesday, July 4, 2017 - 5:45:33 PM
Last modification on : Tuesday, July 4, 2017 - 5:47:02 PM
Long-term archiving on: : Friday, December 15, 2017 - 1:36:14 AM

File

978-3-642-33475-7_13_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Galina Jirásková, Benedek Nagy. On Union-Free and Deterministic Union-Free Languages. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.179-192, ⟨10.1007/978-3-642-33475-7_13⟩. ⟨hal-01556208⟩

Share

Metrics

Record views

106

Files downloads

260