J. Brzozowski

activity

20082018

most citedOn the State Complexity of the Shuffle of Regular Languages

19 citations · 121 across the 33 of their papers we have counts for

collaborators

Showing 2016 · cs.FLShow all

4 papers · 2 filters

cs.FL2016★ 1 cited

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages

Janusz Brzozowski, Corwin Sinnamom

A language $L$ over an alphabet $Σ$ is suffix-convex if, for any words $x, y, z \in Σ^{*}$ , whenever $z$ and $x y z$ are in $L$ , then so is $y z$ . Suffix-convex languages include three spec…

cs.FL2016★ 6 cited

Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages

Janusz Brzozowski, Corwin Sinnamon

We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L_{m}^{'}$ and $L_{n}$ are languages of state complexities $m$ and $…

cs.FL2016★ 2 cited

Complexity of Prefix-Convex Regular Languages

Janusz Brzozowski, Corwin Sinnamon

A language $L$ over an alphabet $Σ$ is prefix-convex if, for any words $x, y, z \in Σ^{*}$ , whenever $x$ and $x y z$ are in $L$ , then so is $x y$ . Prefix-convex languages include right-idea…

cs.FL2016★ 15 cited

Unrestricted State Complexity of Binary Operations on Regular Languages

Janusz Brzozowski

I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if $L_{m}^{'}$ and $L_{n}$ are languages restricted to be over the s…