8 citations · 13 across the 3 of their papers we have counts for
4 papers
Most Complex Regular Right-Ideal Languages
Janusz Brzozowski, Gareth Davies
A right ideal is a language L over an alphabet A that satisfies L = LA*. We show that there exists a stream (sequence) (R_n : n \ge 3) of regular right ideal languages, where R_n h…
Maximally Atomic Languages
Janusz Brzozowski, Gareth Davies
The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language an…
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms
Janusz Brzozowski, Gareth Davies
We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is…
On the omega-limit sets of tent maps
Andrew Barwell, Gareth Davies, Chris Good
For a continuous map f on a compact metric space (X,d), a subset D of X is internally chain transitive if for every x and y in D and every delta > 0 there is a sequence of points {…