Results 21 to 30 of about 283,589 (317)
A description based on languages of the final non-deterministic automaton
Theoretical Computer Science, 2014 The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the ...
A. Ballester‐Bolinches +2 more
openalex +4 more sources
Precise estimation on the order of local testability of deterministic finite automaton [PDF]
, 2020 15 ...
A. N. Trahtman
openalex +4 more sources
Determinisability of register and timed automata [PDF]
Logical Methods in Computer Science, 2022 The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente +2 more
doaj +1 more source
Languages of single-valued neutrosophic general automata [PDF]
Journal of Mahani Mathematical Research, 2023 In this paper, we define the concepts of single-valued neutrosophic general automaton, complete and deterministic single-valued neutrosophic general automaton.
Marzieh Shamsizadeh +2 more
doaj +1 more source
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
Minimization and Canonization of GFG Transition-Based Automata [PDF]
Logical Methods in Computer Science, 2022 While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata.
Bader Abu Radi, Orna Kupferman
doaj +1 more source
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
Using the past for resolving the future
Frontiers in Computer Science, 2023 Nondeterminism models an ability to see the future: An automaton with an infinite look ahead can successfully resolve its nondeterministic choices. An automaton is history deterministic (HD) if it can successfully resolve its nondeterministic choices in ...
Orna Kupferman
doaj +1 more source
Active Learning of Deterministic Timed Automata with Myhill-Nerode Style Characterization [PDF]
International Conference on Computer Aided Verification, 2023 We present an algorithm to learn a deterministic timed automaton (DTA) via membership and equivalence queries. Our algorithm is an extension of the L* algorithm with a Myhill-Nerode style characterization of recognizable timed languages, which is the ...
Masaki Waga
semanticscholar +1 more source
On Determinism and Unambiguity of Weighted Two-way Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism.
Vincent Carnino, Sylvain Lombardy
doaj +1 more source