OpenNWA: A Nested-Word Automaton Library [chapter]

Evan Driscoll, Aditya Thakur, Thomas Reps
2012 Lecture Notes in Computer Science  
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
more » ... WALi-the W eighted Automaton Li brary-and interoperates closely with the weighted pushdown system portions of WALi.
doi:10.1007/978-3-642-31424-7_47 fatcat:y7efqdwq3vhaxfq66v5lqv4gee