Parametric Matching System Development of Fully-mechanized Face Equipments Based on UG
Analyzes the technical parameters of "three machines" and makes research on parametric matching of the fully-mechanized coal face equipments.Then,generates applications named "the parametric matching system of fully-mechanized coal face equipments",based on Visual C++ as redevelop language in UG software,providing scientific basis for equipment selection and matching.
Abstract We initiate a multi-parameter analysis of two well-known NP-hard problems on deterministic finite automata (DFAs): the problem of finding a short synchronizing word, and that of finding a DFA on few states consistent with a given sample of the intended language and its complement. For both problems, we study natural parameterizations and classify them with the tools provided by Parameterized Complexity. Somewhat surprisingly, in both cases, rather simple FPT algorithms can be shown to be optimal, mostly assuming the (Strong) Exponential Time Hypothesis.