A Decidable Instance of the Inclusion Problem for Rational Relations
نویسندگان
چکیده
We study an instance of the inclusion problem for rational relations over words. In this paper we show how to check if a one generator submonoid {w}∗ ⊆ (Σ∗) is included in the prefix closure of a rational relation R ⊆ (Σ∗) given by a multi-tape finite automaton.
منابع مشابه
On Equivalence and Uniformisation Problems for Finite Transducers
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper, we investigate stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and sho...
متن کاملAnimal Suffering: A Moorean Response to a Problem of Evil
In this paper, I propose a new response to a particular instance of the problem of evil: the problem of animal suffering. My solution, in brief, is that the rational theist may argue, justifiably, that an omnipotent, omniscient, omnibenevolent God would not allow gratuitous animal suffering to occur, and, therefore, all instances of animal suffering that are encountered are not instanc...
متن کاملGraph Logics with Rational Relations
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword or subse...
متن کاملSeparability of rational relations in A* × Nm by recognizable relations is decidable
Given a direct product of monoids M = A∗ ×Nm where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
متن کاملMulti-sequential Word Relations
Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that can be realised by input-deterministic transducers. Some rational functions are not sequential. However, based on a property on transducers called the twinni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011