Identities and transductions

Harju, Tero; Hoogeboom, Hendrik Jan; Kleijn, H. C. M.

doi:10.1007/3-540-58131-6_43

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Except for the above-mentioned algorithm, some basic properties of Abelian groups, and some basic notions from Linear Algebra, the material of this article is self-contained. For additional detailed exposition of the topics, presented in this article, we refer to [4] and [6]. In [13] the triples (Γ, g, G), where Γ is a not necessary finite undirected graph, G is a group and g is a function from the set of edges of Γ to G, are considered.…”

mentioning

confidence: 99%

On the structure of the group of balanced labelings on graphs

Cherniavsky

Goldstein²,

Levit

2013

The Seventh European Conference on Combinatorics, Graph Theory and Applications

View full text Add to dashboard Cite

We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian group. We study the structure of this group and the structure of two closely related to it groups: the subgroup of balanced labelings which consists of functions vanishing on vertices and the corresponding factor-group. This work is completely self-contained, except the algorithm for obtaining the 3-edge-connected components of an undirected graph, for which we make appropriate references to the literature.

show abstract

mentioning

confidence: 99%

On the structure of the group of balanced labelings on graphs

Cherniavsky

Goldstein²,

Levit

2013

The Seventh European Conference on Combinatorics, Graph Theory and Applications

View full text Add to dashboard Cite

show abstract

Channel Synthesis for Finite Transducers

Benattar

Bérard

Lime

et al. 2012

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We investigate how two agents can communicate through a noisy medium modeled as a finite non deterministic transducer. The sender and the receiver are also described by finite transducers which can respectively encode and decode binary messages. When the communication is reliable, we call the encoder/decoder pair a channel. We study the channel synthesis problem which, given a transducer, asks whether or not such sender and receiver exist and builds them if the answer is positive. To that effect we introduce the structural notion of encoding state in a transducer which is a necessary condition for the existence of a channel. It is not, however, a sufficient condition. In fact, we prove that the problem is undecidable. Nonetheless, we obtain a synthesis procedure when the transducer is functional. We discuss these results in relation to security properties.

show abstract

Identities and transductions

Cited by 2 publications

References 10 publications

On the structure of the group of balanced labelings on graphs

On the structure of the group of balanced labelings on graphs

Channel Synthesis for Finite Transducers

Contact Info

Product

Resources

About