default search action
"Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional ..."
Georg Bachmeier, Michael Luttenberger, Maximilian Schlund (2015)
- Georg Bachmeier, Michael Luttenberger, Maximilian Schlund:
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. LATA 2015: 473-485
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.