scholarly journals Minimization of Limit-Average Automata

2021 ◽  
Author(s):  
Jakub Michaliszyn ◽  
Jan Otop
Keyword(s):  
Polynomial Time ◽  
Equivalence Relation ◽  
Minimization Problem ◽  
Value Function ◽  
Equivalence Classes ◽  
Minimization Algorithm ◽  
Infinite Words ◽  
Average Value ◽  
Weighted Automata

LimAvg-automata are weighted automata over infinite words that aggregate weights along runs with the limit-average value function. In this paper, we study the minimization problem for (deterministic) LimAvg-automata. Our main contribution is an equivalence relation on words characterizing LimAvg-automata, i.e., the equivalence classes of this relation correspond to states of an equivalent LimAvg-automaton. In contrast to relations characterizing DFA, our relation depends not only on the function defined by the target automaton, but also on its structure. We show two applications of this relation. First, we present a minimization algorithm for LimAvg-automata, which returns a minimal LimAvg-automaton among those equivalent and structurally similar to the input one. Second, we present an extension of Angluin's L^*-algorithm with syntactic queries, which learns in polynomial time a LimAvg-automaton equivalent to the target one.

SINGULAR SWITCHED LINEAR SYSTEMS: SOME GEOMETRIC ASPECTS

2012 ◽  
Vol 26 (25) ◽  
pp. 1246006
Author(s):  
H. DIEZ-MACHÍO ◽  
J. CLOTET ◽  
M. I. GARCÍA-PLANAS ◽  
M. D. MAGRET ◽  
M. E. MONTORO
Keyword(s):  
Linear Systems ◽  
Group Action ◽  
Lie Group ◽  
Equivalence Relation ◽  
Geometric Approach ◽  
Differentiable Manifold ◽  
Equivalence Classes ◽  
Switched Linear Systems ◽  
Lie Group Action

We present a geometric approach to the study of singular switched linear systems, defining a Lie group action on the differentiable manifold consisting of the matrices defining their subsystems with orbits coinciding with equivalence classes under an equivalence relation which preserves reachability and derive miniversal (orthogonal) deformations of the system. We relate this with some new results on reachability of such systems.

Entanglement complexity of graphs in Z3

1992 ◽  
Vol 111 (1) ◽  
pp. 75-91 ◽  
Author(s):  
C. E. Soteros ◽  
D. W. Sumners ◽  
S. G. Whittington
Keyword(s):  
Crossing Number ◽  
Equivalence Classes ◽  
Closed Curve ◽  
Good Measure ◽  
Average Value ◽  
Cut Edge ◽  
Expected Complexity ◽  
Almost All

AbstractIn this paper we are concerned with questions about the knottedness of a closed curve of given length embedded in Z3. What is the probability that such a randomly chosen embedding is knotted? What is the probability that the embedding contains a particular knot? What is the expected complexity of the knot? To what extent can these questions also be answered for a graph of a given homeomorphism type?We use a pattern theorem due to Kesten 12 to prove that almost all embeddings in Z3 of a sufficiently long closed curve contain any given knot. We introduce the idea of a good measure of knot complexity. This is a function F which maps the set of equivalence classes of embeddings into 0, ). The F measure of the unknot is zero, and, generally speaking, the more complex the prime knot decomposition of a given knot type, the greater its F measure. We prove that the average value of F diverges to infinity as the length (n) of the embedding goes to infinity, at least linearly in n. One example of a good measure of knot complexity is crossing number.Finally we consider similar questions for embeddings of graphs. We show that for a fixed homeomorphism type, as the number of edges n goes to infinity, almost all embeddings are knotted if the homeomorphism type does not contain a cut edge. We prove a weaker result in the case that the homeomorphism type contains at least one cut edge and at least one cycle.

scholarly journals A General Theory of Wilf-Equivalence for Catalan Structures

10.37236/5629 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Michael Albert ◽  
Mathilde Bouvel
Keyword(s):  
General Theory ◽  
Equivalence Relation ◽  
Generating Functions ◽  
Asymptotic Estimate ◽  
Equivalence Classes ◽  
Catalan Number ◽  
Combinatorial Structures ◽  
Dyck Paths ◽  
Significant Interest ◽  
Wilf Equivalence

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences or generating functions of various hereditary classes of combinatorial structures has attracted significant interest. We investigate such coincidences among non-crossing matchings and a variety of other Catalan structures including Dyck paths, 231-avoiding permutations and plane forests. In particular we consider principal subclasses defined by not containing an occurrence of a single given structure. An easily computed equivalence relation among structures is described such that if two structures are equivalent then the associated principal subclasses have the same enumeration sequence. We give an asymptotic estimate of the number of equivalence classes of this relation among structures of size $n$ and show that it is exponentially smaller than the $n^{th}$ Catalan number. In other words these "coincidental" equalities are in fact very common among principal subclasses. Our results also allow us to prove in a unified and bijective manner several known Wilf-equivalences from the literature.

Cauchy Points of Metric Locales

1989 ◽  
Vol 41 (5) ◽  
pp. 830-854 ◽  
Author(s):  
B. Banaschewski ◽  
A. Pultr
Keyword(s):  
Equivalence Relation ◽  
Metric Spaces ◽  
Equivalence Classes ◽  
Classical Description ◽  
Natural Approach ◽  
Precise Meaning ◽  
Natural Equivalence ◽  
Cauchy Sequences

A natural approach to topology which emphasizes its geometric essence independent of the notion of points is given by the concept of frame (for instance [4], [8]). We consider this a good formalization of the intuitive perception of a space as given by the “places” of non-trivial extent with appropriate geometric relations between them. Viewed from this position, points are artefacts determined by collections of places which may in some sense by considered as collapsing or contracting; the precise meaning of the latter as well as possible notions of equivalence being largely arbitrary, one may indeed have different notions of point on the same “space”. Of course, the well-known notion of a point as a homomorphism into 2 evidently fits into this pattern by the familiar correspondence between these and the completely prime filters. For frames equipped with a diameter as considered in this paper, we introduce a natural alternative, the Cauchy points. These are the obvious counterparts, for metric locales, of equivalence classes of Cauchy sequences familiar from the classical description of completion of metric spaces: indeed they are decreasing sequences for which the diameters tend to zero, identified by a natural equivalence relation.

scholarly journals On the Groups of Cobordism Ωk

1958 ◽  
Vol 13 ◽  
pp. 135-156 ◽  
Author(s):  
Masahisa Adachi
Keyword(s):  
Equivalence Relation ◽  
Differentiable Manifold ◽  
Equivalence Classes ◽  
Graded Algebra ◽  
Differentiable Manifolds ◽  
Free Part ◽  
Natural Way

In the papers [11] and [18] Rohlin and Thom have introduced an equivalence relation into the set of compact orientable (not necessarily connected) differentiable manifolds, which, roughly speaking, is described in the following manner: two differentiable manifolds are equivalent (cobordantes), when they together form the boundary of a bounded differentiable manifold. The equivalence classes can be added and multiplied in a natural way and form a graded algebra Ω relative to the addition, the multiplication and the dimension of manifolds. The precise structures of the groups of cobordism Ωk of dimension k are not known thoroughly. Thom [18] has determined the free part of Ω and also calculated explicitly Ωk for 0 ≦ k ≦ 7.

scholarly journals Bipolar Fuzzy Relations

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1044 ◽  
Author(s):  
Jeong-Gon Lee ◽  
Kul Hur
Keyword(s):  
Equivalence Class ◽  
Level Set ◽  
Equivalence Relation ◽  
Level Sets ◽  
Equivalence Classes ◽  
Fuzzy Relation ◽  
Fuzzy Relations ◽  
Transitive Relation ◽  
Fuzzy Partition

We introduce the concepts of a bipolar fuzzy reflexive, symmetric, and transitive relation. We study bipolar fuzzy analogues of many results concerning relationships between ordinary reflexive, symmetric, and transitive relations. Next, we define the concepts of a bipolar fuzzy equivalence class and a bipolar fuzzy partition, and we prove that the set of all bipolar fuzzy equivalence classes is a bipolar fuzzy partition and that the bipolar fuzzy equivalence relation is induced by a bipolar fuzzy partition. Finally, we define an ( a , b ) -level set of a bipolar fuzzy relation and investigate some relationships between bipolar fuzzy relations and their ( a , b ) -level sets.

scholarly journals Borel structures and Borel theories

2011 ◽  
Vol 76 (2) ◽  
pp. 461-476 ◽  
Author(s):  
Greg Hjorth ◽  
André Nies
Keyword(s):  
Equivalence Relation ◽  
Equivalence Classes ◽  
Strong Sense ◽  
Borel Equivalence Relation ◽  
And Function

AbstractWe show that there is a complete, consistent Borel theory which has no “Borel model” in the following strong sense: There is no structure satisfying the theory for which the elements of the structure are equivalence classes under some Borel equivalence relation and the interpretations of the relations and function symbols are uniformly Borel.We also investigate Borel isomorphisms between Borel structures.

WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS

2011 ◽  
Vol 22 (08) ◽  
pp. 1829-1844 ◽  
Author(s):  
MANFRED DROSTE ◽  
INGMAR MEINECKE
Keyword(s):  
Power Consumption ◽  
Average Cost ◽  
Peak Power ◽  
Regular Expressions ◽  
Infinite Words ◽  
New Class ◽  
Weighted Automata ◽  
Peak Power Consumption ◽  
Weight Structures

Quantitative aspects of systems like consumption of resources, output of goods, or reliability can be modeled by weighted automata. Recently, objectives like the average cost or the longtime peak power consumption of a system have been modeled by weighted automata which are not semiring weighted anymore. Instead, operations like limit superior, limit average, or discounting are used to determine the behavior of these automata. Here, we introduce a new class of weight structures subsuming a range of these models as well as semirings. Our main result shows that such weighted automata and Kleene-type regular expressions are expressively equivalent both for finite and infinite words.

Sign in / Sign up

Export Citation Format

Share Document