Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity : Language and automata theory and applications (International conference)
In: Lecture notes in computer science 8977:473-485; Jg. 8977 (2015) S. 473-485
Konferenz
Zugriff:
Titel: |
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity : Language and automata theory and applications (International conference)
|
---|---|
Autor/in / Beteiligte Person: | Bachmeier, Georg ; Luttenberger, Michael ; Schlund, Maximilian |
Link: | |
Quelle: | Lecture notes in computer science 8977:473-485; Jg. 8977 (2015) S. 473-485 |
Veröffentlichung: | 2015 |
Medientyp: | Konferenz |
ISSN: | 0302-9743 (print) |
Sonstiges: |
|