The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019
DOI: 10.1016/j.tcs.2018.09.016
|View full text |Cite
|
Sign up to set email alerts
|

Complexity of bifix-free regular languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Finally, our results enabled establishing the existence of most complex bifix-free languages ( [12,13]).…”
Section: Discussionmentioning
confidence: 56%
See 1 more Smart Citation
“…Finally, our results enabled establishing the existence of most complex bifix-free languages ( [12,13]).…”
Section: Discussionmentioning
confidence: 56%
“…These are languages that meet all the upper bounds on the state complexities of Boolean operations, product, star, and reversal, and also have maximal syntactic semigroups and most complex atoms [10]. In particular, the results from this paper enabled the study of most complex bifix-free languages [12].…”
Section: Introductionmentioning
confidence: 92%