Results 41 to 50 of about 307 (62)
Sturmian and infinitely desubstitutable words accepted by an {\omega}-automaton
, 2023 Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one.
Béaur, Pierre +1 more
core
Crisp-determinization of weighted tree automata over strong bimonoids [PDF]
, 2021 Fülöp Zoltán +2 more
core +1 more source
Weighted Tree Generating Regular Systems over Strong Bimonoids with Reduction Semantics [PDF]
, 2022 Kószó Dávid
core +1 more source
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable [PDF]
, 2020 Droste Manfred +3 more
core +1 more source
Regular language quantum states
We introduce regular language states, a family of quantum many-body states. They are built from a special class of formal languages, called regular, which has been thoroughly studied in the field of computer science.
Alhambra, Álvaro M. +3 more
core
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids [PDF]
, 2022 Droste Manfred +3 more
core +1 more source
The generating power of weighted tree automata with initial algebra semantics
We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of the underlying strong bimonoid. We consider locally finite, weakly locally
Droste, Manfred +3 more
core
On the Representation of Block Languages
In this paper we consider block languages, namely sets of words having the same length, and we propose a new representation for these languages. In particular, given an alphabet of size $k$ and a length $\ell$, these languages can be represented by ...
Duarte, Guilherme +3 more
core
Addition in Dumont-Thomas Numeration Systems in Theory and Practice
Given a fixpoint of a substitution, the associated Dumont-Thomas numeration system provides a convenient immediate way to describe the fixpoint as an automatic sequence.
Carton, Olivier +3 more
core