Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
type: Item
instance of: scholarly article
title: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
zbMATH Open document ID: 1280.68108
author: Baiyu Li
author: Yuli Ye
author: Janusz Brzozowski
published in: Theoretical Computer Science
publication date: 2012-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6065028
zbMATH Keywords: bifix-free
zbMATH Keywords: factor-free
zbMATH Keywords: finite automaton
zbMATH Keywords: monoid
zbMATH Keywords: prefix-free
zbMATH Keywords: regular language
zbMATH Keywords: reversal
zbMATH Keywords: semigroup
zbMATH Keywords: suffix-free
zbMATH Keywords: syntactic complexity
describes a project that uses: GAP
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.04.011
OpenAlex ID: W1978707564
cites work: Q5725992
cites work: Quotient complexity of regular languages
cites work: Q5740416
cites work: Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
cites work: Syntactic Complexity of Ideal and Closed Languages
cites work: Q5542138
cites work: Classical finite transformation semigroups. An introduction.
cites work: State complexity of basic operations on suffix-free regular languages
cites work: Q3655366
cites work: On deterministic finite automata and syntactic monoid size
cites work: Some remarks on the combinatorics of \(\mathcal{IS}_n\).
cites work: Implementation and Application of Automata
cites work: Q5628039
cites work: Q5641083
cites work: Linear Automaton Transformations
cites work: The Enumeration of Trees by Height and Diameter
cites work: Forests of labeled trees
cites work: Q4001349
cites work: State complexity of regular languages
DOI: 10.1016/J.TCS.2012.04.011
Recommended article: Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
Recommended article: Syntactic complexity of bifix-free regular languages
Recommended article: Q4964027
Recommended article: Complexity of bifix-free regular languages
Recommended article: Syntactic complexity of bifix-free languages
Recommended article: Complexity of Suffix-Free Regular Languages
Recommended article: Complexity of suffix-free regular languages
Recommended article: Syntactic complexity of suffix-free languages
Recommended article: Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
description: scientific article; zbMATH DE number 6065028