Some Results on the Generalized Star-Height Problem

@article{Pin1992SomeRO,
  title={Some Results on the Generalized Star-Height Problem},
  author={Jean-{\'E}ric Pin and Howard Straubing and Denis Th{\'e}rien},
  journal={Inf. Comput.},
  year={1992},
  volume={101},
  pages={219-250}
}
Abstract We prove some results related to the generalized star-height problem. In this problem, as opposed to the restricted star-height problem, complementation is considered as a basic operator. We first show that the class of languages of star-height ≤ n is closed under certain operations (left and right quotients, inverse alphabetic morphisms, injective star-free substitutions). It is known that languages recognized by a commutative group are of star-height 1. We extend this result to… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Remark on the Star-Height Problem

W. Thomas
  • Theoret. Comput. Sci. 13
  • 1981
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Automata

S. Eilenberg
  • Languages and Machines, Academic Press, New York, Vol. A, 1974; Vol B
  • 1976
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

On Finite Monoids Having Only Trivial Subgroups

  • Information and Control
  • 1965
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Complexity of some problems from the theory of automata

J. Stern
  • Information and Computation, 66,
  • 1985
VIEW 1 EXCERPT