Modern aspects of complexity within formal languages
From MaRDI portal
Publication:2278257
DOI10.1007/978-3-030-13435-8_1zbMath1425.68197OpenAlexW2912678774MaRDI QIDQ2278257
Publication date: 4 December 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_1
context-free grammarsmultivariate analysisfinite automatafixed-parameter tractabilitystring problemsfine-grained complexity
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems
This page was built for publication: Modern aspects of complexity within formal languages