Hankel Matrices for Weighted Visibly Pushdown Automata
arXiv:1512.02430 · doi:10.1007/978-3-319-30000-9
Abstract
Hankel matrices (aka connection matrices) of word functions and graph parameters have wide applications in automata theory, graph theory, and machine learning. We give a characterization of real-valued functions on nested words recognized by weighted visibly pushdown automata in terms of Hankel matrices on nested words. This complements C. Mathissen's characterization in terms of weighted monadic second order logic.
14 pages, 2 Figures. Originally appeared in the 10th International Conference on Language and Automata Theory and Applications (LATA 2016), with an imprecision in the proof. This version was made precise and simplified