On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups (2016)
Attributed to:
Automata, Languages, Decidability in Algebra
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.tcs.2016.09.024
Publication URI: http://dx.doi.org/10.1016/j.tcs.2016.09.024
Type: Journal Article/Review
Parent Publication: Theoretical Computer Science