3 results about "Nondeterministic finite automaton" patented technology

This paper proposes a method for obtaining a minimal LTLf automaton. The method is based on Brzozowski's theory of minimal automata construction, completing the construction of a minimal DFA from LTLf. The method includes: for a given LTLf formula, first using the tool MONA to construct a corresponding inverse deterministic automaton for the LTLf, which can accept reverse sequences of the original LTLf receiving language; inverting the inverse deterministic automaton to obtain a nondeterministic finite state automaton (NFA); performing a subset construction calculation on the NFA, and then performing a reachable state calculation to remove all unreachable states. According to Brzozowski's theory, this DFA is the minimized DFA corresponding to the LTLf formula.

This invention relates to a system for identifying complex event patterns in real-time video analytics data input, the system comprising a query compiler, a surrogate model, a first inference module, and a second inference module. The invention also relates to a method for identifying complex event patterns in real-time video analytics data input, comprising: converting a query into a nondeterministic finite automaton using a query compiler; predicting a surrogate score using a surrogate model; estimating the probability that a window matches a query pattern; filtering out windows unlikely to match the query pattern; adaptively instantiating events within the window until it can be determined whether a match is guaranteed or impossible; and returning a window guaranteed to contain a match.

A system for identifying a complex event pattern in a data input for real-time video analysis is disclosed. The system includes a query compiler, a proxy model, a first inference module, and a second inference module. A method for identifying a complex event pattern in a data input for real-time video analysis is disclosed. The method includes: translating a query into a nondeterministic finite automaton (NFA) using a query compiler; predicting proxy scores using a proxy model; estimating a probability of a window matching a query pattern; filtering out windows with a very low likelihood of matching the query pattern; adaptively materializing events within the windows until it can be determined whether a match is guaranteed or impossible; and returning windows that must contain a matc.