Displaying similar documents to “Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability”

A fully equational proof of Parikh’s theorem

Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We show that the validity of Parikh’s theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of μ -term equations of continuous commutative idempotent semirings.

Iteration of rational transductions

Alain Terlutte, David Simplot (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Decision problems among the main subfamilies of rational relations

Olivier Carton, Christian Choffrut, Serge Grigorieff (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we investigate the following decision problem: given a relation in one of the families, does it belong to a smaller family? We settle the problem entirely when all monoids have a unique generator and fill some gaps in the general case. In particular, adapting a proof of Stearns, we show that it is recursively decidable whether...