On union-free and deterministic union-free languages

Authors:
Galina Jirásková;Benedek Nagy
Affiliations:
Mathematical Institute, Slovak Academy of Sciences, Košice, Slovakia;Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary
Venue:
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Year:
2012

Citing 6
Cited 0

Regular languages

Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Minimal Union-Free Decompositions of Regular Languages

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Determination of finite automata accepting subregular languages

Theoretical Computer Science
Networks of evolutionary processors with subregular filters

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Contextual Grammars with Subregular Choice

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Quantified Score

Hi-index	0.00

Visualization

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.