The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 121 –
140 of
186
For a class of hypersubstitutions 𝓚, we define the 𝓚-solidity of general varieties of tree languages (GVTLs) that contain tree languages over all alphabets, general varieties of finite algebras (GVFAs), and general varieties of finite congruences (GVFCs). We show that if 𝓚 is a so-called category of substitutions, a GVTL is 𝓚-solid exactly in case the corresponding GVFA, or the corresponding GVFC, is 𝓚-solid. We establish the solidity status of several known GVTLs with respect to certain categories...
Si utilizza la nozione di réte di semiautòmi con struttura variabile nel tempo, per ottenere un criterio di decomposizione dei semiautòmi con struttura variabile. Si mette in evidenza il ruolo di una congruenza nella decomposizione di questo tipo di semiautònomi.
A language L ⊆A* is literally idempotent in case that
ua2v ∈ L if and only if uav ∈ L, for each u,v ∈ A*, a ∈ A.
Varieties of literally idempotent languages result naturally by taking
all literally idempotent languages in a classical (positive) variety
or by considering a certain closure operator on classes of languages.
We initiate the systematic study of such varieties. Various classes of
literally idempotent languages can
be characterized using syntactic methods.
A starting example is the...
We prove that the function that maps a word of a rational language onto
its successor for the radix order in this language
is a finite union of co-sequential functions.
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
In our main result, we establish a formal connection between
Lindström quantifiers with respect to regular languages and
the double semidirect product of finite monoids
with a distinguished set of generators.
We use this correspondence to characterize the expressive power
of Lindström quantifiers associated with a class of regular
languages.
Let
Lϕ,λ = {ω ∈ Σ∗
| ϕ(ω) > λ} be the
language recognized by a formal series
ϕ:Σ∗ → ℝ with isolated cut point
λ. We provide new conditions that guarantee the regularity of the
language Lϕ,λ in the case that
ϕ is rational or ϕ is a Hadamard quotient of rational
series. Moreover the decidability property of such conditions is investigated.
Let Lϕ,λ = {ω ∈ Σ∗ | ϕ(ω) > λ} be the language recognized by a formal series ϕ:Σ∗ → ℝ with isolated cut point λ. We provide new conditions that guarantee the regularity of the language Lϕ,λ in the case that ϕ is rational or ϕ is a Hadamard quotient of rational series. Moreover the decidability property of such conditions is investigated.
Let
Lϕ,λ = {ω ∈ Σ∗
| ϕ(ω) > λ} be the
language recognized by a formal series
ϕ:Σ∗ → ℝ with isolated cut point
λ. We provide new conditions that guarantee the regularity of the
language Lϕ,λ in the case that
ϕ is rational or ϕ is a Hadamard quotient of rational
series. Moreover the decidability property of such conditions is investigated.
Currently displaying 121 –
140 of
186