Abstract
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, such as parenthesis matching, yet retain all the desirable closure characteristics of finite-state automata. This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automata-theoretic operations, such as intersection, determinization, and complementation. It is packaged with WALi-the Weighted Automaton Library-and interoperates closely with the weighted pushdown system portions of WALi. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Driscoll, E., Thakur, A., & Reps, T. (2012). OpenNWA: A nested-word automaton library. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7358 LNCS, pp. 665–671). https://doi.org/10.1007/978-3-642-31424-7_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
