Results 31 to 40 of about 283,589 (317)
History-Deterministic Timed Automata [PDF]
International Conference on Concurrency Theory, 2023 We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-
T. Henzinger +2 more
semanticscholar +1 more source
On Semantically-Deterministic Automata [PDF]
International Colloquium on Automata, Languages and Programming, 2023 A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic choices in the automaton lead to equivalent states. Semantic determinism is interesting as it is a natural relaxation of determinism, and as some applications ...
Bader Abu Radi, O. Kupferman
semanticscholar +1 more source
Exact Anomalous Current Fluctuations in a Deterministic Interacting Model. [PDF]
Physical Review Letters, 2022 We analytically compute the full counting statistics of charge transfer in a classical automaton of interacting charged particles. Deriving a closed-form expression for the moment generating function with respect to a stationary equilibrium state, we ...
Žiga Krajnik +4 more
semanticscholar +1 more source
DETERMINISTIC FINITE AUTOMATA LEARNING USING COUNTEREXAMPLE GUIDED ABSTRACTION REFINEMENT [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper studies minimum-sized deterministic finite automata inferring problem. A hybrid method is developed and implemented reducing the given problem to Boolean satisfiability (SAT) technique and at the same time applying a ...
Ilya T. Zakirzyanov
doaj +1 more source
Intrinsic Simulations between Stochastic Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner.
Pablo Arrighi +2 more
doaj +1 more source
Representing Small Ordinals by Finite Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
doaj +1 more source
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields [PDF]
Logic in Computer Science, 2022 The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one.
J. Bell, Daniel Smertnig
semanticscholar +1 more source
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees.
Christof Löding, Sarah Winter
doaj +1 more source
Using probabilistic fuzzy models for the prediction of functional failures of microwave LSI with radiation exposure [PDF]
ITM Web of Conferences, 2019 The article presents an analysis of microwave LSI behavior under radiation exposure at the functional-logical level of description. The analysis is based on fuzzy digital automaton and topological probabilistic models of workability assessment.
Barbashov Vyacheslav +2 more
doaj +1 more source
Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees
Современные информационные технологии и IT-образование, 2021 In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source