Deterministic automaton
View article
Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game Open
The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they…
View article
One Theorem to Rule Them All Open
We present a unified translation of LTL formulas into deterministic Rabin\nautomata, limit-deterministic B\\"uchi automata, and nondeterministic B\\"uchi\nautomata. The translations yield automata of asymptotically optimal size\n(double or…
View article
Verification of Detectability for Unambiguous Weighted Automata Open
International audience
View article
The Černý Conjecture and 1-Contracting Automata Open
A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. Černý conjectured in 1964 that a synchronizing automaton with $n$ states has a synchronizing word of length …
View article
Experimental demonstration of quantum finite automaton Open
In quantum information science, a major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields. It has been shown that the q…
View article
Towards the Heider balance with a cellular automaton Open
The state of structural balance (termed also `Heider balance') of a social network is often discussed in social psychology and sociophysics. In this state, actors at network nodes classify other individuals as enemies or friends. Hence, th…
View article
Synchronization and Stability of Finite Automata Open
Let G = (V,E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors in such a way that each vertex has one edge of each color leavi…
View article
Control of Black-Box Embedded Systems by Integrating Automaton Learning and Supervisory Control Theory of Discrete-Event Systems Open
The paper presents an approach to the control of black-box embedded systems by integrating automaton learning and supervisory control theory (SCT) of discrete-event systems (DES), where automaton models of both the system and requirements …
View article
Büchi Good-for-Games Automata Are Efficiently Recognizable Open
Good-for-Games (GFG) automata offer a compromise between deterministic and nondeterministic automata. They can resolve nondeterministic choices in a step-by-step fashion, without needing any information about the remaining suffix of the wo…
View article
Semicomputable Points in Euclidean Spaces Open
We introduce the notion of a semicomputable point in R^n, defined as a point having left-c.e. projections. We study the range of such a point, which is the set of directions on which its projections are left-c.e., and is a convex cone. We …
View article
Characterization of sets of limit measures of a cellular automaton iterated on a random configuration Open
The asymptotic behaviour of a cellular automaton iterated on a random configuration is well described by its limit probability measure(s). In this paper, we characterize measures and sets of measures that can be reached as limit points aft…
View article
Development of vehicle speed forecasting method for intelligent highway transport system Open
Interaction of vehicles on an intercity highway is considered. The vehicle control model here is idealized, close to the 4th generation automated intelligent transport system. Each vehicle has the desired motion program, independent of the…
View article
Canonical Representations of k-Safety Hyperproperties Open
Hyperproperties elevate the traditional view of trace properties form sets of traces to sets of sets of traces and provide a formalism for expressing information-flow policies. For trace properties, algorithms for verification, monitoring,…
View article
Minimization and Canonization of GFG Transition-Based Automata Open
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. The latter are nondeterministic automata that can reso…
View article
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata Open
In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of LTL with past operators) is equivalent to a formula of the form $\bigwedge_{i=1}^n \mathbf{G}\mathbf{F} \var…
View article
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata Open
We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi automata, and nondeterministic Büchi automata. The translations yield automata of asymptotically optimal size (double or single e…
View article
Minimizing GFG Transition-Based Automata (Track B: Automata, Logic, Semantics, and Theory of Programming) Open
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games automata. The latter are nondeterministic automata that can resolve th…
View article
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton Open
Unambiguous non-deterministic finite automata (UFA) are non-deterministic automata (over finite words) such that there is at most one accepting run over each input. Such automata are known to be potentially exponentially more succinct than…
View article
One Theorem to Rule Them All: A Unified Translation of LTL into {\omega}-Automata Open
We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Buchi automata, and nondeterministic Buchi automata. The translations yield automata of asymptotically optimal size (double or single e…
View article
The Lamplighter Group ℤ<sub>3</sub>≀ℤ Generated by a Bireversible Automaton Open
We construct a bireversible self-dual automaton with three states over an alphabet with three letters which generates the lamplighter group ℤ3≀ℤ. In particular, this fact shows that not all groups defined by birevirsible automata are finit…
View article
Reset Complexity of Ideal Languages Over a Binary Alphabet Open
We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. We compare the reset complexity and the state complexity for …
View article
Regular omega-Languages with an Informative Right Congruence Open
A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon auto…
View article
Evrostos Open
Robust Linear Temporal Logic (rLTL) was crafted to incorporate the notion of robustness into Linear-time Temporal Logic (LTL) specifications. Technically, robustness was formalized in the logic rLTL via 5 different truth values and it led …
View article
Learning the Language of Software Errors Open
We propose to use algorithms for learning deterministic finite automata (DFA), such as Angluin’s L* algorithm, for learning a DFA that describes the possible scenarios under which a given program error occurs. The alphabet of this automato…
View article
Minimal Determinization Algorithm for Fuzzy Automata Open
The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decisio…
View article
The complete finite automaton Open
There is well-known, that for the description of a regular language, there are different complete invariants: not only well-known canonical automata, but also basis automata and universal automata. While constructing basis and universal au…
View article
The Algorithm of Continuous Optimization Based on the Modified Cellular Automaton Open
This article is devoted to the application of the cellular automata mathematical apparatus to the problem of continuous optimization. The cellular automaton with an objective function is introduced as a new modification of the classic cell…
View article
Neural network for synthesizing deterministic finite automata Open
Deterministic finite automata are widely used in control systems: from abstract protocols such as TCP to mechanical devices such as elevators or traffic lights. Some of these systems are quite complex and can be defined only in terms of fo…
View article
Topology algorithm built as an automaton with flexible rules Open
Developing novel methods, approaches and computational techniques is essential for solving efficiently more and more demanding up-to-date engineering problems. Designing durable, light and eco-friendly structures starts at the conceptual s…
View article
Induction of Subgoal Automata for Reinforcement Learning Open
In this work we present ISA, a novel approach for learning and exploiting subgoals in reinforcement learning (RL). Our method relies on inducing an automaton whose transitions are subgoals expressed as propositional formulas over a set of …