On Union-Free and Deterministic Union-Free Languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

On Union-Free and Deterministic Union-Free Languages

(1) , (2)
1
2
Galina Jirásková
  • Function : Author
  • PersonId : 1011781
Benedek Nagy
  • Function : Author
  • PersonId : 1011782

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.
Fichier principal
Vignette du fichier
978-3-642-33475-7_13_Chapter.pdf (463.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556208 , version 1 (04-07-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
46 View
214 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More