Files in this item
On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
Item metadata
dc.contributor.author | Bourne, Tom | |
dc.contributor.author | Ruškuc, Nik | |
dc.date.accessioned | 2017-10-05T23:32:22Z | |
dc.date.available | 2017-10-05T23:32:22Z | |
dc.date.issued | 2016-11-15 | |
dc.identifier.citation | Bourne , T & Ruškuc , N 2016 , ' On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups ' , Theoretical Computer Science , vol. 653 , pp. 87-96 . https://doi.org/10.1016/j.tcs.2016.09.024 | en |
dc.identifier.issn | 0304-3975 | |
dc.identifier.other | PURE: 246307305 | |
dc.identifier.other | PURE UUID: e8ec086c-5cdc-4ab7-83e3-17c64cfdb491 | |
dc.identifier.other | Scopus: 84992046926 | |
dc.identifier.other | WOS: 000387627500007 | |
dc.identifier.other | ORCID: /0000-0003-2415-9334/work/73702080 | |
dc.identifier.uri | https://hdl.handle.net/10023/11811 | |
dc.description.abstract | Given a word w over a finite alphabet, we consider, in three special cases, the generalised star-height 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 star-height at most one. | |
dc.language.iso | eng | |
dc.relation.ispartof | Theoretical Computer Science | en |
dc.rights | © 2016, Elsevier. This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at www.sciencedirect.com / https://dx.doi.org/10.1016/j.tcs.2016.09.024 | en |
dc.subject | Regular language | en |
dc.subject | Star-height | en |
dc.subject | Subword | en |
dc.subject | Rees matrix semigroup | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.sponsor | EPSRC | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. School of Mathematics and Statistics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1016/j.tcs.2016.09.024 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2017-10-05 | |
dc.identifier.grantnumber | GR/S53503/01 | en |
dc.identifier.grantnumber | EP/H011978/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.