Related papers: Stallings automata
Multi-stack machines and Turing machines can simulate to each other. In this note, we give a succinct definition of multi-stack machines, and from this definition it is clearly seen that pushdown automata and deterministic finite automata…
Automated driving systems (ADSs) promise a safe, comfortable and efficient driving experience. However, fatalities involving vehicles equipped with ADSs are on the rise. The full potential of ADSs cannot be realized unless the robustness of…
This Dissertation collects my results on the interpretation, characterization, quantification and application of bipartite and multipartite entanglement in Gaussian states of continuous variable systems.
A conceptual framework for variational formulations of physical theories is proposed. Such a framework is displayed here just for statics, but it is designed to be subsequently adapted to variational formulations of static field theories…
To present a survey on known results from the theory of transposed Poisson algebras, as well as to establish new results on this subject, are the main aims of the present paper. Furthermore, a list of open questions for future research is…
This Thesis is devoted to the analysis of entanglement in relevant physical systems. Entanglement is the conducting theme of this research, though I do not dedicate to a single topic, but consider a wide scope of physical situations. I have…
An overview of current multiple alignment systems to date are described.The useful algorithms, the procedures adopted and their limitations are presented.We also present the quality of the alignments obtained and in which cases(kind of…
The method of controlled Lagrangians for discrete mechanical systems is extended to include potential shaping in order to achieve complete state-space asymptotic stabilization. New terms in the controlled shape equation that are necessary…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…
This paper has a twofold purpose: to present an overview of the theory of absolutely summing operators and its different generalizations for the multilinear setting, and to sketch the beginning of a research project related to an objective…
The paper addresses the problem of computing maximal expected time to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually, terminate. This problem can exhibit high computational…
We describe a particular control method for a system controlled by several actuators with the same control constants. We show under certain assumptions that the control constants for the whole system can be obtained immediately from the…
Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata…
A review of the superstatistics concept is provided, including various recent applications to complex systems.
The synchronization problem is investigated for the class of locally strongly transitive automata introduced in a previous work of the authors. Some extensions of this problem related to the notions of stable set and word of minimal rank of…
The purpose of this paper is to introduce the concept of the automatic integration and present a new way of approximating definite integrals using the automatic integration based on an associative algebra with zero divisors.
Many combinatorial optimization problems can be mapped to finding the ground states of the corresponding Ising Hamiltonians. The physical systems that can solve optimization problems in this way, namely Ising machines, have been attracting…
This is an exposition for mathematicians of some unsolved problems arising in control theory of linear time-independent systems.
A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various…
Reactive lattice gas automata provide a microscopic approachto the dynamics of spatially-distributed reacting systems. After introducing the subject within the wider framework of lattice gas automata (LGA) as a microscopic approach to the…