Cited By
View all- Okhotin ASalomaa K(2011)Descriptional complexity of unambiguous nested word automataProceedings of the 5th international conference on Language and automata theory and applications10.5555/2022896.2022931(414-426)Online publication date: 26-May-2011
- Salomaa K(2011)Limitations of lower bound methods for deterministic nested word automataInformation and Computation10.1016/j.ic.2010.11.021209:3(580-589)Online publication date: 1-Mar-2011
- Piao XSalomaa K(2009)Operational state complexity of nested word automataTheoretical Computer Science10.1016/j.tcs.2009.05.002410:35(3290-3302)Online publication date: 1-Aug-2009