Skip to main content
SpringerLink
Log in
Book cover

International Conference on Constraints in Computational Logics

CCL 1994: Constraints in Computational Logics pp 217–218Cite as

Symbolic constraints and tree automata

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 845))

This is a preview of subscription content, log in via an institution.

References

  1. A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet, and F. Jacquemard. Pumping, cleaning and symbolic constraints solving. In Proc. Int. Conference on Algorithms, Languages and Programming, Jerusalem, July 1994.

    Google Scholar 

  2. M. Dauchet. Rewriting and tree automata. In Hubert Comon and Jean-Pierre Jouannaud, editors, Proc. Spring School on Theoretical Computer Science: Rewriting, Lecture Notes in Computer Science, to appear, Odeillo, France, 1994. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale de Lille, CNRS et Université de Lille I, 59655, Villeneuve d'Ascq, France

    Max Dauchet

Authors
  1. Max Dauchet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dauchet, M. (1994). Symbolic constraints and tree automata. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016855

Download citation

  • DOI: https://doi.org/10.1007/BFb0016855

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58403-2

  • Online ISBN: 978-3-540-48699-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation