Descriptional Complexity of Union and Star on Context-Free Languages
From MaRDI portal
Publication:5178451
DOI10.25596/jalc-2012-123zbMath1322.68119OpenAlexW2399680295MaRDI QIDQ5178451
Publication date: 16 March 2015
Full work available at URL: https://dblp.uni-trier.de/db/journals/jalc/jalc17.html#DassowH12
Related Items (4)
State complexity of permutation on finite languages over a binary alphabet ⋮ Further Remarks on the Operational Nonterminal Complexity ⋮ Operational Accepting State Complexity: The Unary and Finite Case ⋮ Operational complexity and right linear grammars
This page was built for publication: Descriptional Complexity of Union and Star on Context-Free Languages