Cyclic Languages and Strongly Cyclic Languages

@inproceedings{Bal1996CyclicLA,
  title={Cyclic Languages and Strongly Cyclic Languages},
  author={Marie-Pierre B{\'e}al and Olivier Carton and Christophe Reutenauer},
  booktitle={STACS},
  year={1996}
}
We prove that cyclic languages are the boolean closure of languages called strongly cyclic languages. The result is used to give another proof of the rationality of the zeta function of rational cyclic languages. 

From This Paper

Topics from this paper.
6 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Theory of codes

  • Jean Berstel, Dominique Perrin
  • 1984

Symbolic dynamics

  • Rufus Bowen
  • 1978

Axiom A di eomorphisms have rationnal zeta fonctions

  • A. Manning.
  • Bull . London Math . Soc .

Similar Papers

Loading similar papers…