Projects per year
Abstract
Given a word w over a finite alphabet, we consider, in three special cases,
the generalised starheight of the languages in which w occurs as a contiguous subword (factor) an exact number of times and of the languages in which w occurs as a contiguous subword modulo a fixed number, and prove that in each case it is at most one. We use these combinatorial results to show that any language recognised by a Rees (zero)matrix semigroup over an abelian group is of generalised starheight at most one.
the generalised starheight of the languages in which w occurs as a contiguous subword (factor) an exact number of times and of the languages in which w occurs as a contiguous subword modulo a fixed number, and prove that in each case it is at most one. We use these combinatorial results to show that any language recognised by a Rees (zero)matrix semigroup over an abelian group is of generalised starheight at most one.
Original language  English 

Pages (fromto)  8796 
Journal  Theoretical Computer Science 
Volume  653 
Early online date  5 Oct 2016 
DOIs  
Publication status  Published  15 Nov 2016 
Keywords
 Regular language
 Starheight
 Subword
 Rees matrix semigroup
Fingerprint
Dive into the research topics of 'On the starheight of subword counting languages and their relationship to Rees zeromatrix semigroups'. Together they form a unique fingerprint.Projects
 2 Finished

Automata Languages Decidability: Automata, Languages, Decidability in Algebra
1/03/10 → 31/05/14
Project: Standard

EPSRC GR/S53503/01: Applications of Automata and Languages in the Theory of Pattern Classes of Permutations
Ruskuc, N., Linton, S. A. & Robertson, E. F.
1/02/04 → 31/01/07
Project: Standard