On Union-Free and Deterministic Union-Free Languages - Theoretical Computer Science
Conference Papers Year : 2012

On Union-Free and Deterministic Union-Free Languages

Galina Jirásková
  • Function : Author
  • PersonId : 1011781
Slovak Academy of Sciences
Benedek Nagy
  • Function : Author
  • PersonId : 1011782
University of Debrecen

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.

Domains

Computer Science [cs]
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)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01556208

Submitted on : Tuesday, July 4, 2017-5:45:33 PM

Last modification on : Thursday, June 6, 2024-9:10:03 AM

Long-term archiving on : Friday, December 15, 2017-1:36:14 AM

Download

Dates and versions

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

Licence

Attribution

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-TC2 IFIP-TCS IFIP-WG2-2 IFIP-LNCS-7604
82 View
272 Download

Altmetric

Share

More