Abstract
We define a new class of tree automata which generalizes both the encompassment automata of [3] and the automata with tests between brothers of [2]. We give a pumping lemma for these automata, which implies that the emptiness of the corresponding language is decidable. Then, we show how to decide emptiness by means of a ”cleaning” algorithm, which leads to more effective decision procedures.
This research was supported by the operation “Modèles de Calcul” of the PRC d'informatique.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair. Proof by consistency in equational theories. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, July 1988.
B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Lectures Notes in Computer Science, volume 577, pages 161–171, Paris, 1992. Symposium on Theoretical Aspects of Computer Science.
A. Caron, J. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, LNCS 690, pages 328–342, Montréal, 1993. 5th international conference on Rewriting Techniques and Applications.
A. Caron, J. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. Technical report, Laboratoire d'Informatique Fondamentale de Lille, 1993. to appear.
H. Comon. Unification et disunification. Théorie et applications. PhD thesis, I.N.P.Grenoble, 1988.
H. Comon. Equational formulas on order-sorted algebras. In Proceedings of ICALP'90, pages 674–688, 1990.
M. Dauchet and S. Tison. Structural complexity of classes of tree languages. In M. Nivat and A. Podelski, editors, Tree Automata and Languages, pages 327–353. Elsevier Science, 1992.
N. Dershowitz and J. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter Rewrite Systems, pages 243–320. Elsevier, 1990.
M. Fernández. Narrowing based procedures for equational disunification. Applicable Algebra in Engineering Communication and Computing, 3:1–26, 1992.
J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Information and Computation, 82(1):1–33, July 1989.
D. Kapur, P. Narendran, and H. Zhang. On sufficient-completeness and related properties of term rewriting systems. Acta Informatica, 24:395–415, 1987.
E. Kounalis. Testing for the ground (co)-reducibility in term rewriting systems. Theorical Computer Sciences, 106(1):87–117, 1992.
M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, pages 348–357, July 1988.
J. Mongy. Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, 1981.
D. Plaisted. Semantic confluence tests and completion method. Information and Control, 65:182–215, 1985.
R. Socher-Ambrosius. Order-sorted unification with term declarations. In Proc. Int. Conference on Logic Programming and Automated Reasoning, LNCS, 1993.
T. E. Uribe. Sorted Unification Using Set Constraints. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, New York, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caron, A.C., Comon, H., Coquidé, J.L., Dauchet, M., Jacquemard, F. (1994). Pumping, cleaning and symbolic constraints solving. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_88
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive