Title of article
Complexity in Prefix-Free Regular Languages
Author/Authors
Galina Jiraskova، نويسنده , , Monika Krausov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
197
To page
204
Abstract
We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next provide the tight bounds on state complexity of symmetric difference, and deterministic and nondeterministic state complexity of difference and cyclic shift of prefix-free languages.
Keywords
Grammatical inference , observation tables , residual languages
Journal title
Electronic Proceedings in Theoretical Computer Science
Serial Year
2010
Journal title
Electronic Proceedings in Theoretical Computer Science
Record number
679944
Link To Document