scientific article; zbMATH DE number 1775632
From MaRDI portal
Publication:4544433
zbMath0999.68119MaRDI QIDQ4544433
Publication date: 4 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (15)
The Turing way to parameterized complexity ⋮ On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection ⋮ Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ The complexity of intersecting finite automata having few final states ⋮ Problems on finite automata and the exponential time hypothesis ⋮ Fixed Structure Complexity ⋮ Parameterized Complexity and Approximability of the SLCS Problem ⋮ Parameterized complexity and approximability of the longest compatible sequence problem ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ Fine-grained complexity of safety verification ⋮ Problems on Finite Automata and the Exponential Time Hypothesis ⋮ On the Complexity of Bounded Context Switching. ⋮ Parameterized complexity of basic decision problems for tree automata ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems
This page was built for publication:
