Results 21 to 30 of about 51,114 (288)
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching [PDF]
Acta InformaticaAbstract Given a deterministic finite automaton (DFA) A, we present a simple algorithm for constructing deterministic finite automata that accept the shortest forbidden factors, the shortest forbidden prefixes, the shortest forbidden suffixes, the shortest forbidden words, the shortest allowed suffixes, and the shortest allowed words of the ...
Jan Janoušek, Štěpán Plachý
+6 more sources
Aerospace, 2020 In this note, the application of a plant model-based fault detection method for nonlinear control systems on aircraft takeoff is introduced. This method utilizes non-deterministic finite-state automata, which approximate the fault-free dynamics of the ...
Ferdinand Settele +2 more
doaj +2 more sources
A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads [PDF]
International Workshop on Reversible Computation, 2013 A two-way multi-head finite automaton (MFA) is a variant of a finite automaton consisting of a finite-state control, a finite number of heads that can move in two directions, and a read-only input tape. Here, we show that for any given deterministic MFA we can construct a reversible MFA with the same number of heads that accepts the same language as ...
K. Morita
openaire +3 more sources
On generating a random deterministic finite automaton as well as its failure equivalent
, 2015 An algorithm is proposed that constructs a failure deterministic finite automaton in lockstep with the construction of a languageequivalent deterministic finite automaton. The states of both automata are assumed to be predefined and the failure deterministic finite automaton's symbol and failure transitions are randomised.
Madoda Nxumalo +3 more
openalex +3 more sources
Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]
Logical Methods in Computer Science, 2021 An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some
Alexander Rabinovich, Doron Tiferet
doaj +1 more source
Herald of Tver State University. Series: Applied Mathematics, 2019 Elmira Shamilyevna Kremleva
openalex +3 more sources
Adaptive Non-linear Pattern Matching Automata [PDF]
Logical Methods in Computer Science, 2021 Efficient pattern matching is fundamental for practical term rewrite engines. By preprocessing the given patterns into a finite deterministic automaton the matching patterns can be decided in a single traversal of the relevant parts of the input term ...
Rick Erkens, Maurice Laveaux
doaj +1 more source
Finitely generated subgroups of free groups as formal languages and their cogrowth [PDF]
Groups, Complexity, Cryptology, 2021 For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language.
Arman Darbinyan +2 more
doaj +1 more source
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata [PDF]
Annual Symposium on Combinatorial Pattern Matching, 2023 Sorting is a fundamental algorithmic pre-processing technique which often allows to represent data more compactly and, at the same time, speeds up search queries on it.
Sung-Hwan Kim +2 more
semanticscholar +1 more source
Token Games and History-Deterministic Quantitative-Automata [PDF]
Logical Methods in Computer Science, 2023 A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and
Udi Boker, Karoliina Lehtinen
doaj +1 more source