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 realvalued functions on nestedwords recognized byweighted visibly pushdown automata in terms of Hankel matrices on nested words. This complements C. Mathissen’s characterization in terms ofweighted monadic second order logic.
Cite
CITATION STYLE
Labai, N., & Makowsky, J. A. (2016). Hankel matrices for weighted visibly pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9618, pp. 464–477). Springer Verlag. https://doi.org/10.1007/978-3-319-30000-9_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
