Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot. Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. In Hsu-Chun Yen, Oscar H. Ibarra, editors, Developments in Language Theory - 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Volume 7410 of Lecture Notes in Computer Science, pages 226-238, Springer, 2012. [doi]

Abstract

Abstract is missing.