19 citations · 121 across the 33 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.FL2011★ 4 cited
Syntactic Complexity of Star-Free Languages
Janusz Brzozowski, Baiyu Li
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic c…
cs.FL2011
Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages
Janusz Brzozowski, Baiyu Li, Yuli Ye
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maxima…
cs.FL2011
Theory of Atomata
Janusz Brzozowski, Hellis Tamm
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "átomaton", whose states are the "atoms" of the language, that is, non-e…