Lernverfahren für Automaten über linearisierten XML-Dokumenten

Angluin D (1987) Learning regular sets from queries and counterexamples. Inf Comput 75(2):87–106

Bárány V, Löding C, Serre O (2006) Regularity problems for visibly pushdown languages. In: Proceedings of the 23rd Annual Symposioum on Theoretical Aspects of Computer Science (STACS’06), 3884:420–431, Springer, Berlin Heidelberg

Esparza J, Hansel D, Rossmanith P, Schwoon S (2000) Efficient Algorithms for Model Checking Pushdown Systems. Computer Aided Verification, S 232–247

Gold EM (1967) Language identification in the limit. Inf Control 10(5):447–474

Oncína J, Garcia P (1992) Inferring regular languages in polynomial update time. Pattern Recognit Image Anal 1:49–61

Segoufin L, Sirangelo C (2007) Constant-memory validation of streaming XML documents against DTDs. In: Proc. ICDT’07, 4353:299–313, Springer, Berlin Heidelberg

Segoufin L, Vianu V (2002) Validating streaming XML documents. In: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, S 53–64, ACM Press, New York, NY, USA