2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.FL2011★ 2 cited
Finite Orbits of Language Operations
E. Charlier, M. Domaratzki, T. Harju +1
We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. T…
cs.FL2009★ 1 cited
State complexity of orthogonal catenation
Mark Daley, Michael Domaratzki, Kai Salomaa
A language is the orthogonal catenation of languages and if every word of can be written in a unique way as a catenation of a word in and a word in .…