Skip to search formSkip to main contentSkip to account menu

Star height problem

The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
451 species and subspecies of ground beetles were reported for Mongolia. 29 species are new for the fauna: Calosoma sycophanta… 
Review
2013
Review
2013
Personality is strongly influenced by motivation systems that organise responses to rewards and punishments and that drive… 
2013
2013
We improve previously known universality results on enzymatic numerical P systems (EN P systems, for short) working in all… 
2010
2010
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are… 
Highly Cited
2005
Highly Cited
2005
  • D. Kirsten
  • RAIRO Theor. Informatics Appl.
  • 2005
  • Corpus ID: 13442720
We show that it is decidable in time complexity \(2^{2^{2^{O{(n)}}}}\) whether the language accepted by an n-state non… 
1994
1994
C longitudinal relaxation times and nuclear Overhauser enhancements were measured as a function of temperature in three magnetic… 
Review
1973
Review
1973
'Every being, which during its natural life time produces several eggs or seeds, must suffer destruction during some period of… 
1968
1968
This paper deals with cycle rank of finite transition graphs and its relation to the (restricted) star height of regular events…