@inproceedings{10.1007/978-3-319-42634-1_47,
    Abstract = {In the last two decades visibly pushdown languages (VPLs) have found many applications in diverse areas such as formal verification and processing of XML documents. Recently, there has been a significant interest in studying quantitative versions of finite-state systems as well as visibly pushdown systems. In this work, we take forward this study for visibly pushdown systems by considering a functional version of visibly pushdown automata. Our version is formally a generalization of cost register automata (CRA) defined by [Alur et al., 2013]. We observe that our model continues to have all the good properties of the CRAs in spite of being a generalization.},
    Address = {Cham},
    Author = {Krebs, Andreas and Limaye, Nutan and Ludwig, Michael},
    BookTitle = {Computing and Combinatorics},
    Editor = {Dinh, Thang N. and Thai, My T.},
    File = {Cost Register Automata for Nested Words - computing-and-combinatorics-2016 - c.pdf},
    ISBN = {978-3-319-42634-1},
    Pages = {587--598},
    Publisher = {Springer International Publishing},
    Title = {Cost Register Automata for Nested Words},
    Year = {2016},
    date-added = {2022-04-04 07:36:17 +0200},
    date-modified = {2022-04-04 07:36:17 +0200},
    doi = {10.1007/978-3-319-42634-1_47}
}

@inproceedings{10.1007/978-3-319-42634-1_47, Abstract = {In the last two decades visibly pushdown languages (VPLs) have found many applications in diverse areas such as formal verification and processing of XML documents. Recently, there has been a significant interest in studying quantitative versions of finite-state systems as well as visibly pushdown systems. In this work, we take forward this study for visibly pushdown systems by considering a functional version of visibly pushdown automata. Our version is formally a generalization of cost register automata (CRA) defined by [Alur et al., 2013]. We observe that our model continues to have all the good properties of the CRAs in spite of being a generalization.}, Address = {Cham}, Author = {Krebs, Andreas and Limaye, Nutan and Ludwig, Michael}, BookTitle = {Computing and Combinatorics}, Editor = {Dinh, Thang N. and Thai, My T.}, File = {Cost Register Automata for Nested Words - computing-and-combinatorics-2016 - c.pdf}, ISBN = {978-3-319-42634-1}, Pages = {587--598}, Publisher = {Springer International Publishing}, Title = {Cost Register Automata for Nested Words}, Year = {2016}, date-added = {2022-04-04 07:36:17 +0200}, date-modified = {2022-04-04 07:36:17 +0200}, doi = {10.1007/978-3-319-42634-1_47} }