Results 1 to 10 of about 101,767 (128)
Automata theory in nominal sets [PDF]
Logical Methods in Computer Science, 2014 We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
Bojańczyk, Mikołaj +2 more
openaire +7 more sources
ioco theory for probabilistic automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Comment: In Proceedings MBT 2015, arXiv:1504 ...
Marcus Gerhold, Mariëlle Stoelinga
openaire +5 more sources
Determinising Parity Automata [PDF]
, 2014 Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the
Schewe, Sven, Varghese, Thomas
core +1 more source
Theoretical Computer Science, 1994 AbstractWe propose timed (finite) automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words–infinite sequences in which a real-valued time of occurrence is
David L. Dill, Rajeev Alur
openaire +2 more sources
Bell's Theorem from Moore's Theorem [PDF]
, 2012 It is shown that the restrictions of what can be inferred from classically-recorded observational outcomes that are imposed by the no-cloning theorem, the Kochen-Specker theorem and Bell's theorem also follow from restrictions on inferences from ...
Ashby W. R. +19 more
core +1 more source
Minimization via duality [PDF]
, 2012 We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata.
A. Beimel +9 more
core +2 more sources
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests [PDF]
, 2014 We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea
Bouajjani A. +10 more
core +5 more sources
Effective theories for circuits and automata [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2011 Abstracting an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological, computational, and social systems makes the problem harder.
openaire +4 more sources
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases [PDF]
, 2008 This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations
A. Cobham +15 more
core +7 more sources
Automata theory on sliding windows [PDF]
, 2017 In a recent paper we analyzed the space complexity of streaming algorithms whose goal is to decide membership of a sliding window to a fixed language. For the class of regular languages we proved a space trichotomy theorem: for every regular language the optimal space bound is either constant, logarithmic or linear.
Ganardi, Moses +4 more
openaire +4 more sources