Author:
Hofmann Martin,Lange Martin
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. A. R. Meyer and L. J. Stockmeyer. Word problems requiring exponential time. In Proc. 5th Symp. on Theory of Computing, STOC’73, pages 1–9, New York, 1973. ACM.
2. T. Schwentick. Automata for XML - a survey. J. Comput. Syst. Sci., 73(3):289–315, 2007.
3. H. Comon and Y. Jurski. Higher-order matching and tree automata. In Proc. 11th Int. Conf. on Computer Science Logic, CSL’97, volume 1414 of LNCS, pages 157–176. Springer, 1997.
4. C. Stirling. A game-theoretic approach to deciding higher-order matching. In Proc. 33rd Int. Coll. on Automata, Languages and Programming, ICALP’06, volume 4052 of LNCS, pages 348–359. Springer, 2006.
5. H. Hosoya and B. C. Pierce. XDuce: A statically typed XML processing language. ACM Trans. Internet Techn., 3(2):117–148, 2003.