Pushpa Publishing House

Journal Menu

Content

Volume 17 (2018)

Volume 16 (2016)

Volume 15 (2015)

Volume 14 (2015)

Volume 13 (2014)

Volume 12 (2014)

Volume 11 (2013)

Volume 10 (2013)

Volume 9 (2012)

Volume 8 (2012)

Volume 7 (2011)

Volume 6 (2011)

Volume 5 (2010)

	Volume 5, Issue 2 Pg 131 - 263 (November 2010)
	Volume 5, Issue 1 Pg 1 - 129 (August 2010)

Volume 4 (2010)

Volume 3 (2009)

Volume 2 (2008)

Volume 1 (2007)

-->

Important: All future articles and volumes will be published only on our new website: www.pphmjopenaccess.com. Authors are requested to submit their papers through the new website only. Visit now: www.pphmjopenaccess.com

Advances in Computer Science and Engineering

Abstract:
Given a family of recognizable languages

and recognizable languages

the relative inclusion star height problem means to compute the minimal star height of some rational expression r over

satisfying

We show that this problem is of elementary complexity and give a detailed analysis of its complexity depending on the representation of

and

and whether

are singletons. We also consider the case

Keywords and phrases: recognizable sets, star height, distance desert automata.

Communicated by Manfred Droste

Number of Downloads: 377 | Number of Views: 1319

Previous Next

P-ISSN: 0973-6999

Journal Stats

Publication count: 171

Citation count (Google Scholar): 0

h10-index (Google Scholar): 0

h-index (Google Scholar): 0

Downloads : 79156

Views: 221902

Downloads/publish articles: 462.9

Citations (Google Scholar)/publish articles: 0