Abstract
A regular tree language L is locally testable if the membership of a tree into L depends only on the presence or absence of some neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is locally testable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bojańczyk, M.: A new algorithm for testing if a regular language is locally threshold testable. Inf. Process. Lett. 104(3), 91–94 (2007)
Bojańczyk, M.: Two-way unary temporal logic over trees. In: IEEE Symposium on Logic in Computer Science (LICS), pp. 121–130 (2007)
Beauquier, D., Pin, J.-E.: Factors of words. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 63–79. Springer, Heidelberg (1989)
Brzozowski, J.A., Simon, I.: Characterizations of locally testable languages. Discrete Math. 4, 243–271 (1973)
Bojańczyk, M., Segoufin, L.: Tree languages defined in first-order logic with one quantifier alternation. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 233–245. Springer, Heidelberg (2008)
Benedikt, M., Segoufin, L.: Regular languages definable in FO and FOmod. In: ACM Trans. of Computational Logic (to appear, 2009)
Bojańczyk, M., Segoufin, L., Straubing, H.: Piecewise testable tree languages. In: IEEE Symposium on Logic in Computer Science (LICS) (2008)
Bojańczyk, M., Walukiewicz, I.: Characterizing ef and ex tree logics. Theoretical Computer Science 358, 255–272 (2006)
Bojańczyk, M., Walukiewicz, I.: Forest algebras. In: Automata and Logic: History and Perspectives, pp. 107–132. Amsterdam University Press (2007)
Esik, Z., Weil, P.: Algebraic characterization of regular tree languages. Theoretical Computer Science 340, 291–321 (2005)
McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor. 8, 60–76 (1974)
Place, T.: Characterization of logics over ranked tree languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 401–415. Springer, Heidelberg (2008)
Straubing, H.: Finite semigroup varieties of the form V*D. Journal of Pure and Applied Algebra 36, 53–94 (1985)
Tilson, B.: Categories as algebra: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48, 83–198 (1987)
Thérien, D., Weiss, A.: Graph congruences and wreath products. J. Pure and Applied Algebra 36, 205–215 (1985)
Wilke, T.: An algebraic characterization of frontier testable tree languages. Theoretical Computer Science 154(1), 85–106 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Place, T., Segoufin, L. (2009). A Decidable Characterization of Locally Testable Tree Languages. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-02930-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02929-5
Online ISBN: 978-3-642-02930-1
eBook Packages: Computer ScienceComputer Science (R0)