Add to ORKGWe show the existence of rational trace languages defined over direct products of free monoids that have inherent ambiguity of the order of log n and n 1/2 . This result is obtained by studying the relationship between trace languages and linear context-free grammars that satisfy a special unambiguity condition on the position of the last step of derivation
International audienceIn the hierarchy of infinite graph families, rational graphs are defined by ra...
International audienceWe give a unified framework to treat the following problem. Let (L_1, ..., L_n...
This paper deals with decision problems related to the star problem in trace monoids, which means to...
Abstract. Star-connected rational expressions were considered only as expressions defining trace lan...
We prove the inherent ambiguity of certain context-free languages, the prototype of which is L={s2t|...
AbstractContext-free grammars and languages with infinite ambiguity can be distinguished by the grow...
This paper deals with decision problems related to the star problem in trace monoids, which means to...
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a...
AbstractThis paper deals with decision problems related to the star problem in trace monoids which m...
We extend the well known notions of ambiguity and of degrees of ambiguity of finitary context free l...
AbstractWe consider the family of languages whose syntactic monoids are R-trivial. Languages whose s...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
AbstractThe main results of the present paper are the equivalence of definability by monadic second-...
AbstractWe establish that several classical context-free languages are inherently ambiguous by provi...
AbstractWe show that some language-theoretic and logical characterizations of recognizable word lang...
International audienceIn the hierarchy of infinite graph families, rational graphs are defined by ra...
International audienceWe give a unified framework to treat the following problem. Let (L_1, ..., L_n...
This paper deals with decision problems related to the star problem in trace monoids, which means to...
Abstract. Star-connected rational expressions were considered only as expressions defining trace lan...
We prove the inherent ambiguity of certain context-free languages, the prototype of which is L={s2t|...
AbstractContext-free grammars and languages with infinite ambiguity can be distinguished by the grow...
This paper deals with decision problems related to the star problem in trace monoids, which means to...
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a...
AbstractThis paper deals with decision problems related to the star problem in trace monoids which m...
We extend the well known notions of ambiguity and of degrees of ambiguity of finitary context free l...
AbstractWe consider the family of languages whose syntactic monoids are R-trivial. Languages whose s...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
AbstractThe main results of the present paper are the equivalence of definability by monadic second-...
AbstractWe establish that several classical context-free languages are inherently ambiguous by provi...
AbstractWe show that some language-theoretic and logical characterizations of recognizable word lang...
International audienceIn the hierarchy of infinite graph families, rational graphs are defined by ra...
International audienceWe give a unified framework to treat the following problem. Let (L_1, ..., L_n...
This paper deals with decision problems related to the star problem in trace monoids, which means to...