相关论文: The $z$-Transform and Automata-Recognizable System…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.…
In the paper, we utilize the recent variational, abstract theorem to show the existence of homoclinic solutions to the Hamiltonian system $$ \dot{z} = J D_z H(z, t), \quad t \in \mathbb{R}, $$ where the Hamiltonian $H : \mathbb{R}^{2N}…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a finite alphabet A. For these systems, we obtain a…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
In this work, the biquaternion Z transformation method is proposed to solve a class of biquaternion recurrence relations. Biqueternion Z transform is an natural extension of the complex Z transform. In the design process, special norm…
This paper describes the design and implementation of a new machine learning model for online learning systems. We aim at improving the intelligent level of the systems by enabling an automated math word problem solver which can support a…
A method of representation of a solution as segments of the series in powers of the step of the independent variable is expanded for solving complex systems of ordinary differential equations (ODE): the Lorenz system and other systems. A…
The advent of recurrent neural networks for handwriting recognition marked an important milestone reaching impressive recognition accuracies despite the great variability that we observe across different writing styles. Sequential…
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…
In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree…
In the paper we consider the linear underdetermined system of a special type. Systems of this type appear in non-homogeneous network flow programming problems in the form of systems of constraints and can be characterized as systems with a…
We consider partial and total reduction of a nonhomogeneous linear system of the operator equations with the system matrix in the same particular form as in paper [N. Shayanfar, M. Hadizadeh 2013]. Here we present two different concepts.…
In this article, we present a new approach to averaging in non-Hamiltonian systems with periodic forcing. The results here do not depend on the existence of a small parameter. In fact, we show that our averaging method fits into an…
A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…
Motivated by neuronal models from neuroscience, we consider the system identification of simple feedback structures whose behaviors include nonlinear phenomena such as excitability, limit-cycles and chaos. We show that output feedback is…
We introduce a class of hyperfields which includes several constructions of non-quotient hyperfields. We then use it to partially answer a question posed by M. Baker and T. Zhang: Does a system of homogeneous linear equations with more…
We introduce a novel technique to analyse unambiguous B\"uchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant…