Results 1 to 10 of about 17,250 (168)
Simplifying Nondeterministic Finite Cover Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA '98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
Cezar Câmpeanu
doaj +3 more sources
Exact and Approximate Determinization of Discounted-Sum Automata [PDF]
Logical Methods in Computer Science, 2014 A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights.
Udi Boker, Thomas A. Henzinger
doaj +6 more sources
HERALD OF POLOTSK STATE UNIVERSITY. Series С FUNDAMENTAL SCIENCESThe paper presents the results of the implementation of a software tool for synthesizing nondeterministic finite automaton using regular expressions in JFF format. Glushkov's algorithm is used as a method for synthesizing automata. When developing the program, the integrated development environment for the Python – Visual Studio Code, the JFLAP ...
D. LOBARYOV, N. LOBARYOV
openaire +2 more sources
Learn with SAT to Minimize Büchi Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that
Stephan Barth, Martin Hofmann
doaj +4 more sources
IEEE AccessWe present a formal and constructive simulation framework for nondeterministic finite automata (NFAs) using time-shared, depth-unrolled feedforward networks (TS-FFNs), i.e., acyclic unrolled computations with shared parameters that are functionally ...
Sahil Rajesh Dhayalkar
doaj +2 more sources
Biomolecular computers with multiple restriction enzymes [PDF]
Genetics and Molecular Biology, 2017 The development of conventional, silicon-based computers has several limitations, including some related to the Heisenberg uncertainty principle and the von Neumann “bottleneck”.
Sebastian Sakowski +5 more
doaj +2 more sources
The Algebra of Nondeterministic Finite Automata [PDF]
arXiv.org, 2023 A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is an NFA ...
R. Gorrieri
semanticscholar +1 more source
Visualizing a Nondeterministic to Deterministic Finite-State Machine Transformation [PDF]
arXiv.org, 2023 The 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.
Tijana Minić, Marco T. Moraz'an
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
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