16,766 research outputs found
Symbolic Register Automata
Symbolic Finite Automata and Register Automata are two orthogonal extensions
of finite automata motivated by real-world problems where data may have
unbounded domains. These automata address a demand for a model over large or
infinite alphabets, respectively. Both automata models have interesting
applications and have been successful in their own right. In this paper, we
introduce Symbolic Register Automata, a new model that combines features from
both symbolic and register automata, with a view on applications that were
previously out of reach. We study their properties and provide algorithms for
emptiness, inclusion and equivalence checking, together with experimental
results
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets
of real numbers encoded in positional notation. We consider Muller automata as
well as the restricted class of weak deterministic automata, used as symbolic
set representations in actual applications. In previous work, it has been
established that the sets of numbers that are recognizable by weak
deterministic automata in two bases that do not share the same set of prime
factors are exactly those that are definable in the first order additive theory
of real and integer numbers. This result extends Cobham's theorem, which
characterizes the sets of integer numbers that are recognizable by finite
automata in multiple bases.
In this article, we first generalize this result to multiplicatively
independent bases, which brings it closer to the original statement of Cobham's
theorem. Then, we study the sets of reals recognizable by Muller automata in
two bases. We show with a counterexample that, in this setting, Cobham's
theorem does not generalize to multiplicatively independent bases. Finally, we
prove that the sets of reals that are recognizable by Muller automata in two
bases that do not share the same set of prime factors are exactly those
definable in the first order additive theory of real and integer numbers. These
sets are thus also recognizable by weak deterministic automata. This result
leads to a precise characterization of the sets of real numbers that are
recognizable in multiple bases, and provides a theoretical justification to the
use of weak automata as symbolic representations of sets.Comment: 17 page
Applications of Automata and Graphs: Labeling-Operators in Hilbert Space I
We show that certain representations of graphs by operators on Hilbert space
have uses in signal processing and in symbolic dynamics. Our main result is
that graphs built on automata have fractal characteristics. We make this
precise with the use of Representation Theory and of Spectral Theory of a
certain family of Hecke operators. Let G be a directed graph. We begin by
building the graph groupoid G induced by G, and representations of G. Our main
application is to the groupoids defined from automata. By assigning weights to
the edges of a fixed graph G, we give conditions for G to acquire fractal-like
properties, and hence we can have fractaloids or G-fractals. Our standing
assumption on G is that it is locally finite and connected, and our labeling of
G is determined by the "out-degrees of vertices". From our labeling, we arrive
at a family of Hecke-type operators whose spectrum is computed. As
applications, we are able to build representations by operators on Hilbert
spaces (including the Hecke operators); and we further show that automata built
on a finite alphabet generate fractaloids. Our Hecke-type operators, or
labeling operators, come from an amalgamated free probability construction, and
we compute the corresponding amalgamated free moments. We show that the free
moments are completely determined by certain scalar-valued functions.Comment: 69 page
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
We first propose algorithms for checking language equivalence of finite
automata over a large alphabet. We use symbolic automata, where the transition
function is compactly represented using a (multi-terminal) binary decision
diagrams (BDD). The key idea consists in computing a bisimulation by exploring
reachable pairs symbolically, so as to avoid redundancies. This idea can be
combined with already existing optimisations, and we show in particular a nice
integration with the disjoint sets forest data-structure from Hopcroft and
Karp's standard algorithm. Then we consider Kleene algebra with tests (KAT), an
algebraic theory that can be used for verification in various domains ranging
from compiler optimisation to network programming analysis. This theory is
decidable by reduction to language equivalence of automata on guarded strings,
a particular kind of automata that have exponentially large alphabets. We
propose several methods allowing to construct symbolic automata out of KAT
expressions, based either on Brzozowski's derivatives or standard automata
constructions. All in all, this results in efficient algorithms for deciding
equivalence of KAT expressions
Dimensions of Neural-symbolic Integration - A Structured Survey
Research on integrated neural-symbolic systems has made significant progress
in the recent past. In particular the understanding of ways to deal with
symbolic knowledge within connectionist systems (also called artificial neural
networks) has reached a critical mass which enables the community to strive for
applicable implementations and use cases. Recent work has covered a great
variety of logics used in artificial intelligence and provides a multitude of
techniques for dealing with them within the context of artificial neural
networks. We present a comprehensive survey of the field of neural-symbolic
integration, including a new classification of system according to their
architectures and abilities.Comment: 28 page
- …