A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the computational complexity of approximating distributions by probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minimum inference of regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized learnability of juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum length of synchronizing words is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5150411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tractability frontier for NFA minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of regular languages using state merging algorithms with search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability of Small Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation Models for Parameterized Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Minimal Separating DFA’s for Compositional Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPAS - A Computing Package for Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of categorial grammars of bounded value, their learnability and related complexity questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Inference as Vertex Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a question of Eggan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Separating Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location problems: a parameterized view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing by the number of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multivariate Analysis of Some DFA Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Reset Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact DFA Identification Using SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3404129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing finite-state machines: state identification and verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the inference of minimum size DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Reset Words in Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum consistent DFA problem cannot be approximated within any polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity Results for 1-safe Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithm for Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P–NP Threshold for Synchronizing Road Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial complete problems in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based testing of reactive systems. Advanced lectures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Road Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying the Upper Bound on the Length of Minimal Synchronizing Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544433 / rank
 
Normal rank

Latest revision as of 18:01, 9 July 2024

scientific article
Language Label Description Also known as
English
A multi-parameter analysis of hard problems on deterministic finite automata
scientific article

    Statements

    A multi-parameter analysis of hard problems on deterministic finite automata (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2015
    0 references
    deterministic finite automata
    0 references
    NP-hard decision problems
    0 references
    synchronizing word
    0 references
    consistency problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers