DEFINITION. A de termin i s t i c l inear bounded a u t o m a t o n (DLBA) is a sixtuple (Q, q0, V, # 1 , # 2 , J ) where: Q is a finite set of states q o , q l .... ; q o E Q is the initial state; V is a finite vocabulary; # 1 , #2 6 V are left and right endmarkers, respectively; and J is a finite set of instructions. T h e automaton consists of two pushdown lists, called L and R, and a finite...

Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterministic automata of m and n states, respectively, then their sum {s+ t | s ∈ S, t ∈ T } is represented by a nondeterministic automaton with 2mn+2m+2n+1 ...

Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...

Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic finite automata, where the conditions for merging states can be efficiently computed. The matter is more complex in the case of non-deterministic finite automata, where merging states can be done in different ways, and the...

Given a word w over a finite alphabet Σ and a finite deterministic automaton A = 〈Q ,Σ, δ〉, the inequality |δ(Q , w)| ≤ |Q | − n means that under the natural action of the wordw the image of the state setQ is reduced by at leastn states. Awordw isn-collapsing if this inequality holds for any deterministic finite automaton that satisfies such an inequality for at least one word. In this paper we...

The problem of describing the dynamics of a conserved energy in a cellular automaton in terms of local movements of “particles” (quanta of that energy) has attracted some people’s attention. The one-dimensional case was already solved by Fukś (2000) and Pivato (2002). For the two-dimensional cellular automata, we show that every (contextfree) conservation law can be expressed in terms of such p...

We consider input deterministic finite state transducers with infinite inputs and outputs, we the property of Borel normality on words. When these are given by a strongly connected set states, when is normal sequence, output an word such that every has frequency weighted automaton over rationals. prove there algorithm decides in cubic time whether transducer preserves normality.

A classical theorem states that the set of languages given by a pushdown automaton coincides with context-free grammar. In previous work, we proved pendant this in setting interaction: processes finite guarded recursive specification over process algebra actions, choice, sequencing and recursion, if only add sequential value passing. paper, look what happens consider parallel automata instead a...

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of...

A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. An automaton is called synchronizing if there exists a word which sends all states of the automaton to a single state. In the present paper we study connections between spectral and synchronizing properties of digraphs. We show that if a coloring of a dig...