Descriptional Complexity of Unambiguous Nested Word Automata.

Alexander Okhotin, Kai Salomaa

Browse the full LATA paper archive.