Sciweavers

CAV
2012
Springer

OpenNWA: A Nested-Word Automaton Library

12 years 2 months ago
OpenNWA: A Nested-Word Automaton Library
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 W eighted Automaton Library—and interoperates closely with the weighted pushdown system portions of WALi.
Evan Driscoll, Aditya V. Thakur, Thomas W. Reps
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where CAV
Authors Evan Driscoll, Aditya V. Thakur, Thomas W. Reps
Comments (0)