Results 61 to 70 of about 2,023 (88)
Some of the next articles are maybe not open access.
Nondeterministic to Deterministic Finite-State Machine Visualization: Implementation and Evaluation
Annual Conference on Innovation and Technology in Computer Science EducationThe transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory.
Marco T. Morazán, Tijana Minić
semanticscholar +1 more source
International Conference on Implementation and Application of Automata
It is proved that every regular expression of alphabetic width $n$, that is, with $n$ occurrences of symbols of the alphabet, can be transformed into a deterministic finite automaton (DFA) with $2^{\frac{n}{2}+(\frac{\log_2 e}{2\sqrt{2}}+o(1))\sqrt{n\ln ...
O. Martynova, Alexander Okhotin
semanticscholar +1 more source
It is proved that every regular expression of alphabetic width $n$, that is, with $n$ occurrences of symbols of the alphabet, can be transformed into a deterministic finite automaton (DFA) with $2^{\frac{n}{2}+(\frac{\log_2 e}{2\sqrt{2}}+o(1))\sqrt{n\ln ...
O. Martynova, Alexander Okhotin
semanticscholar +1 more source
Encoding Co-Lex Orders of Finite-State Automata in Linear Space
Annual Symposium on Combinatorial Pattern MatchingThe Burrows-Wheeler transform (BWT) is a string transformation that enhances string indexing and compressibility. Cotumaccio and Prezza [SODA '21] extended this transformation to nondeterministic finite automata (NFAs) through co-lexicographic partial ...
Ruben Becker +4 more
semanticscholar +1 more source
A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment
arXiv.orgThe rapid growth of symbolic data in areas like internet, biological, and financial data has increased the demand for efficient pattern matching and regular expression processing.
Ryan Karbowniczak, Rasha Karakchi
semanticscholar +1 more source
An Efficient Algorithm for Matching Multiple Patterns
IEEE Transactions on Knowledge and Data Engineering, 1993Jang-Jong Fan, Keh-Yih Su
semanticscholar +1 more source
The design of a DFSA based pattern matcher
, 1991Jang-Jong Fan, Keh-Yih Su
semanticscholar +1 more source
Robust optimal control of regular languages
42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2003C. Lagoa, Jinbo Fu, A. Ray
semanticscholar +1 more source
Signed real measure of regular languages for discrete event supervisory control
, 2005A. Ray
semanticscholar +1 more source
Unconstrained optimal control of regular languages
Proceedings of the 41st IEEE Conference on Decision and Control, 2002., 2002Jinbo Fu, Asok Ray, Constantino M. Lagos
semanticscholar +1 more source
Analytical approach to evaluate language measure parameters for discrete-event supervisory control
, 2006A. Khatab, M. Nourelfath
semanticscholar +1 more source