论文信息 - On Union-Free and Deterministic Union-Free Languages

On Union-Free and Deterministic Union-Free Languages

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.

Benedek Nagy | Galina Jirásková

[1] Jürgen Dassow. Contextual Grammars with Subregular Choice , 2005, Fundam. Informaticae.

[2] Sergey A. Afonin,et al. Minimal Union-Free Decompositions of Regular Languages , 2009, LATA.

[3] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[4] Martin Kutrib,et al. Determination of finite automata accepting subregular languages , 2009, Theor. Comput. Sci..

[5] Wojciech Rytter,et al. On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[6] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[7] Tomás Masopust,et al. Complexity in Union-Free Regular Languages , 2010, Int. J. Found. Comput. Sci..

[8] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[9] Florin Manea,et al. Networks of Evolutionary Processors with Subregular Filters , 2011, LATA.