First, we show with two examples that in test semirings with an incomplete test algebra a domain operation may or may not exist. Second, we show that two notions of separability in test semirings coincide, respectively, with locality of composition and with extensionality of the diamond operators in domain semirings. We conclude with a brief comparison of dynamic algebras and modal Kleene algeb...

This paper is devoted to the survey of some automata-theoretic aspects of diierent exotic semirings, i.e. semirings whose underlying set is some subset of R equiped with min, max or + as sum and/or product. We here adress three types of properties related with rational series with multiplicities in such semirings : structure of supports, decidability of equality and inequality problems, Fatou p...

We generalise existing forward and backward bisimulation minimisation algorithms for tree automata to weighted tree automata. The obtained algorithms work for all semirings and retain the time complexity of their unweighted variants for all additively cancellative semirings. On all other semirings the time complexity is slightly higher (linear instead of logarithmic in the number of states). We...

We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages. In particular, we show that Greibach’s normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chainand deletion rules depend on their inequational properties (and the idem...

One of the key aspects in component-based design is specifying software architecture that characterizes topology and permissible interactions components a system. To achieve well-founded there need to address both qualitative non-functional architectures. In this paper we study quantitative formal modelling architectures applied on parametric systems, consist an unknown number instances each co...

Motivated by a conjecture of Ellentuck concerning fibers f^x(C), f recursive and C an element of one of Barback's "tame models" (Tame models in the isols, Houston J. Math. 12 (1986), 163-175), we study such fibers in the more general context of Nerode semirings. The principal results are that (1) all existentially complete Nerode semirings meet all of their recursive fibers, and (2) not all Ner...

In this study, by generalizing the notion of fuzzy bi-ideals ordered semirings, (∈,∈∨(κ*,qκ))-fuzzy is established. We prove that are but converse not true, and an example provided to support proof. A condition given under which semirings coincide with bi-ideals. An equivalent certain correspondences between presented. Moreover, (κ*,κ)-lower part described depicted in terms several classes semi...