Displaying similar documents to “On infinite real trace rational languages of maximum topological complexity.”

Closure under union and composition of iterated rational transductions

D. Simplot, A. Terlutte (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We proceed our work on iterated transductions by studying the closure under union and composition of some classes of iterated functions. We analyze this closure for the classes of length-preserving rational functions, length-preserving subsequential functions and length-preserving sequential functions with terminal states. All the classes we obtain are equal. We also study the connection with deterministic context-sensitive languages.

On the continuity set of an Omega rational function

Olivier Carton, Olivier Finkel, Pierre Simonnet (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

In this paper, we study the continuity of rational functions realized by Büchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function is continuous. We prove here that surprisingly, it cannot be decided whether such a function  has at least one point of continuity and that its continuity set cannot be computed. In the case of a synchronous rational function, we show that its continuity set is rational and that it can be computed....

Iteration of rational transductions

Alain Terlutte, David Simplot (2000)

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

Similarity:

Polynomial languages with finite antidictionaries

Arseny M. Shur (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

We tackle the problem of studying which kind of functions can occur as complexity functions of formal languages of a certain type. We prove that an important narrow subclass of rational languages contains languages of polynomial complexity of any integer degree over any non-trivial alphabet.

Highly Undecidable Problems For Infinite Computations

Olivier Finkel (2009)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that many classical decision problems about -counter -languages, context free -languages, or infinitary rational relations, are Π½ -complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the unambiguity problem are all Π½ -complete for context-free -languages or for infinitary...