Ask a Question

Prefer a chat interface with context about you and your work?

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity