AbstractIn this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic
Monadic decomposibility - the ability to determine whether a formula in a given logical theory can b...
International audienceWe investigate some basic questions about the interaction of regular and ratio...
In Chapter I of this paper we show that the usual, textbook pairing functions have decidable first-o...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
AbstractThe definition of the class of deterministic rational relations is fundamentally based on th...
We prove that for every countable ordinal α one cannot decide whether a given infinitary rational re...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
Using a novel rewriting problem, we show that several natural decision problems about finite automat...
We consider decision problems for relations over finite and infinite wordsdefined by finite automata...
AbstractThis paper proves two results. (1) Given two bounded context-free languages, it is recursive...
AbstractRational relations (finite transductions) which are equivalence relations are discussed. Aft...
AbstractThis paper proves two results. (1) Given two bounded context-free languages, it is recursive...
We show that many classical decision problems about 1-counter ω-languages, context free ω-language...
Monadic decomposibility - the ability to determine whether a formula in a given logical theory can b...
International audienceWe investigate some basic questions about the interaction of regular and ratio...
In Chapter I of this paper we show that the usual, textbook pairing functions have decidable first-o...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
AbstractThe definition of the class of deterministic rational relations is fundamentally based on th...
We prove that for every countable ordinal α one cannot decide whether a given infinitary rational re...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
Using a novel rewriting problem, we show that several natural decision problems about finite automat...
We consider decision problems for relations over finite and infinite wordsdefined by finite automata...
AbstractThis paper proves two results. (1) Given two bounded context-free languages, it is recursive...
AbstractRational relations (finite transductions) which are equivalence relations are discussed. Aft...
AbstractThis paper proves two results. (1) Given two bounded context-free languages, it is recursive...
We show that many classical decision problems about 1-counter ω-languages, context free ω-language...
Monadic decomposibility - the ability to determine whether a formula in a given logical theory can b...
International audienceWe investigate some basic questions about the interaction of regular and ratio...
In Chapter I of this paper we show that the usual, textbook pairing functions have decidable first-o...
DOI
Add to ORKG