On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups

DOI10.1016/j.tcs.2016.09.024zbMath1353.68160arXiv1603.06236OpenAlexW2963948204MaRDI QIDQ329726

Tom Bourne, Nikola Ruškuc

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.06236

zbMATH Keywords

regular languageRees matrix semigroupstar-heightsubword

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Representation theorems on regular languages
• Some results on the generalized star-height problem
• Transition graphs and the star-height of regular events
• New results on the generalized star-height problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups