3 citations · 9 across the 10 of their papers we have counts for
13 papers
On the Theory of Stochastic Automata
Merve Nur Cakir, Mehwish Saleemi, Karl-Heinz Zimmermann
The theory of discrete stochastic systems has been initiated by the work of Shannon and von Neumann. While Shannon has considered memory-less communication channels and their gener…
On Krohn-Rhodes theory for semiautomata
Karl-Heinz Zimmermann
Krohn-Rhodes theory encompasses the techniques for the study of finite automata and their decomposition into elementary automata. The famous result of Krohn and Rhodes roughly stat…
Dynamic Programming in Topological Spaces
Merve Nur Cakir, Mehwish Saleemi, Karl-Heinz Zimmermann
Dynamic programming is a mathematical optimization method and a computer programming method as well. In this paper, the notion of sheaf programming in topological spaces is introdu…
On the decomposition of generalized semiautomata
Merve Nur Cakir, Karl-Heinz Zimmermann
Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochasti…
On Stochastic Automata over Monoids
Karl-Heinz Zimmermann, Merve Nur Cakir
Stochastic automata over monoids as input sets are studied. The well-definedness of these automata requires an extension postulate that replaces the inherent universal property of…
Distributed Monitoring of Topological Events via Homology
Vincent Knapps, Karl-Heinz Zimmermann
Topological event detection allows for the distributed computation of homology by focusing on local changes occurring in a network over time. In this paper, a model for the monitor…
Inference in Graded Bayesian Networks
Robert Leppert, Karl-Heinz Zimmermann
Machine learning provides algorithms that can learn from data and make inferences or predictions on data. Bayesian networks are a class of graphical models that allow to represent…
Computations in Stochastic Acceptors
Karl-Heinz Zimmermann
Machine learning provides algorithms that can learn from data and make inferences or predictions on data. Stochastic acceptors or probabilistic automata are stochastic automata wit…
D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation
Sallam Abualhaija, Karl-Heinz Zimmermann
Word sense disambiguation (WSD) is a problem in the field of computational linguistics given as finding the intended sense of a word (or a set of words) when it is activated within…
On Binomial Ideals associated to Linear Codes
N. Dück, K. -H. Zimmermann
Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizat…
Graver Bases and Universal Gröbner Bases for Linear Codes
Natalia Dück, Karl-Heinz Zimmermann
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and univ…
Universal Gröbner Bases for Binary Linear Codes
Natalia Dück, Karl-Heinz Zimmermann
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be tran…
A Variant of the Gröbner Basis Algorithm for Computing Hilbert Bases
Natalia Dück, Karl-Heinz Zimmermann
Gröbner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a fi…