In theoretical computer science, more precisely in the theory of formal languages, the star height is a measure for the structural complexity ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Mikolaj Bojanczyk
- 2015 30th Annual ACM/IEEE Symposium on Logic inâ€¦
- 2015

This paper proposes a new algorithm deciding the star height problem. As shown by Kirsten, the star height problem reduces to aâ€¦Â (More)

Is this relevant?

2006

2006

We introduce the notion of nested distance desert automata as a joint generalization and further development of distance automataâ€¦Â (More)

Is this relevant?

2004

2004

- Daniel Kirsten
- FoSSaCS
- 2004

We show that it is decidable in time complexity 2 2O(n) whether the language accepted by an n-state non-deterministic automatonâ€¦Â (More)

Is this relevant?

2000

2000

- Yoram Hirshfeld, Faron Moller
- Proof, Language, and Interaction
- 2000

We prove that for each integer n there is a regular expression over a singleton alphabet which is not bisimilar to any regularâ€¦Â (More)

Is this relevant?

1996

1996

- Fr Ed Erique Bassino
- 1996

We prove a new result on IN-rational series in one variable. This result gives, under an appropriate hypothesis, a necessary andâ€¦Â (More)

Is this relevant?

1992

1992

- John Michael Robson
- Theor. Comput. Sci.
- 1992

Robson, J.M., More languages of generalized star height 1, Theoretical Computer Science 106 (1992) 327-335. Suppose thatâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Kosaburo Hashiguchi
- IFIP Congress
- 1988

Let W= {R,, . . . . R,} be a finite class of regular languages over a finite alphabet Z. Let A = {b,, . . . . 6,) be an alphabetâ€¦Â (More)

Is this relevant?

1984

1984

- Achille J.-P. Braquelaire, Bruno Courcelle
- Automata on Infinite Words
- 1984

Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., weâ€¦Â (More)

Is this relevant?

1976

1976

- Kosaburo Hashiguchi, Namio Honda
- Information and Control
- 1976

A homomorphism f from the set of words over a finite alphabet Z' 1 to the set of words over another finite alphabet X 2 is saidâ€¦Â (More)

Is this relevant?

1971

1971

- Rina S. Cohen
- Mathematical systems theory
- 1971

This paper deals with restricted star height of regular sets, as defined by L. C. Eggan. Theorems relating the star height of aâ€¦Â (More)

Is this relevant?