Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
- 24 February 2015
- book chapter
- Published by Springer Nature
- p. 473-485
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Detecting Ambiguity in Programming Language GrammarsLecture Notes in Computer Science, 2013
- Bounded underapproximationsFormal Methods in System Design, 2012
- Language-Theoretic Abstraction Refinement2012
- Analyzing ambiguity of context-free grammarsScience of Computer Programming, 2010
- The Downward-Closure of Petri Net LanguagesLecture Notes in Computer Science, 2010
- Analyzing Context-Free Grammars Using an Incremental SAT SolverLecture Notes in Computer Science, 2008
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems2008
- Conservative Ambiguity Detection in Context-Free GrammarsLecture Notes in Computer Science, 2007
- Regular Approximation of Context-Free Grammars through Transformation2001
- Effective constructions in well-partially- ordered free monoidsDiscrete Mathematics, 1978