Complexity of proper prefix-convex regular languages

被引：2
|
作者：
Brzozowski, Janusz A. [1 ]
Sinnamon, Corwin [1 ]
机构：
[1] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
THEORETICAL COMPUTER SCIENCE | 2019年 / 787卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Atom; Most complex; Prefix-convex; Proper; Quotient complexity; Regular language; State complexity; Syntactic semigroup;
D O I：
10.1016/j.tcs.2018.07.015
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were studied elsewhere. Here we concentrate on prefix-convex languages that do not belong to any one of these classes; we call such languages proper. We exhibit most complex proper prefix-convex languages, which meet the bounds for the size of the syntactic semigroup, reversal, complexity of atoms, star, product, and boolean operations. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：2 / 13
页数：12
相关论文
共 50 条
12345