Related papers: Algorithms for Glushkov K-graphs
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…
This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset…
We study the parameterized complexity of Split Contraction and Threshold Contraction. In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by…
We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…
[...] In this thesis, we are interested in generalizing factor graphs and the relevant methods toward describing quantum systems. Two generalizations of classical graphical models are investigated, namely double-edge factor graphs (DeFGs)…
In this article, we develop a new approach to functional quantization, which consists in discretizing only a finite subset of the Karhunen-Lo\`eve coordinates of a continuous Gaussian semimartingale $X$. Using filtration enlargement…
The explosion of data available in life sciences is fueling an increasing demand for expressive models and computational methods. Graph transformation is a model for dynamic systems with a large variety of applications. We introduce a novel…
We generalize a result of F.\ Legrand about the existence of non-parametric Galois extensions for a given group $G$. More precisely, for a $K$-regular Galois extension $F|K(t)$, we consider the translates $F(s)|K(s)$ by an extension…
A "book with k pages" consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine,…
Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial…
In this paper, we investigate a series of W-type differential operators, which appear naturally in the symmetry algebras of KP and BKP hierarchies. In particular, they include all operators in the W-constraints for tau functions of higher…
This paper studies which functions computed by $\mathbb{Z}$-weighted automata can be realized by $\mathbb{N}$-weighted automata, under two extra assumptions: commutativity (the order of letters in the input does not matter) and polynomial…
We present a new probabilistic modelling framework based on the recent notion of normal factor graph (NFG). We show that the proposed NFG models and their transformations unify some existing models such as factor graphs, convolutional…
The focus of Part I of this monograph has been on both the fundamental properties, graph topologies, and spectral representations of graphs. Part II embarks on these concepts to address the algorithmic and practical issues centered round…
Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such…
We consider diagrams with up to four t-channel gluons in order to specify gluonic twist-four contributions to deep inelastic structure functions. This enables us to extend the method developed by R.K.Ellis, W.Furmanski, and R.Petronzio…
The $q$-commutation relations, formulated in the setting of the $q$-Fock space of Bo\.zjeko and Speicher, interpolate between the classical commutation relations (CCR) and the classical anti-commutation relations (CAR) defined on the…
Inversion of a directed graph $D$ with respect to a vertex subset $Y$ is the directed graph obtained from $D$ by reversing the direction of every arc whose endpoints both lie in $Y$. More generally, the inversion of $D$ with respect to a…
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…