Results 131 to 140 of about 17,250 (168)
Some of the next articles are maybe not open access.
On Repetitive Finite Automata with Translucent Words
Workshop on Non-Classical Models for Automata and ApplicationsWe introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting or rejecting,
F. Mráz, F. Otto
semanticscholar +1 more source
Jump Complexity of Deterministic Finite Automata with Translucent Letters
International Colloquium on Theoretical Aspects of ComputingWe investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for such an automaton in order to accept an input. The model considered here is
S. Fazekas +3 more
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
Some Properties of Fuzzy Finite Tree Automata
International Journal for Research in Applied Science and Engineering Technology: This paper examines fuzzy tree automata's deterministic, reduced, and homomorphic properties. It is demonstrated through an example that there is a deterministic fuzzy tree automaton for the nondeterministic one.
C. K
semanticscholar +1 more source
Nondeterministic Finite Automata for Modeling an Ecuadorian Sign Language Interpreter
International Conference on Applied Human Factors and Ergonomics, 2020J. Guerra +4 more
semanticscholar +1 more source
Self-certifying Railroad Diagrams - Or: How to Teach Nondeterministic Finite Automata
International Conference on Mathematics of Program Construction, 2019R. Hinze
semanticscholar +1 more source
On Equivalence Checking of Nondeterministic Finite Automata
International Symposium on Software Engineering: Theories, Tools, and Applications, 2017C. Fu +3 more
semanticscholar +1 more source
Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited
Language and Automata Theory and Applications, 2017Hellis Tamm, Brink van der Merwe
semanticscholar +1 more source
On the Number of Active States in Deterministic and Nondeterministic Finite Automata
International Conference on Implementation and Application of Automata, 2017Henning Bordihn, M. Holzer
semanticscholar +1 more source
From Nondeterministic to Multi-Head Deterministic Finite-State Transducers
International Colloquium on Automata, Languages and Programming, 2019Martin Raszyk, D. Basin, Dmitriy Traytel
semanticscholar +1 more source