Complexity of boundary graph languages

JOURNAL ARTICLE published 1990 in RAIRO - Theoretical Informatics and Applications

Authors: Joost Engelfriet | George Leih

Complexity results for prefix grammars

JOURNAL ARTICLE published April 2005 in RAIRO - Theoretical Informatics and Applications

Authors: Markus Lohrey | Holger Petersen

Time and space complexity of reversible pebbling

JOURNAL ARTICLE published April 2004 in RAIRO - Theoretical Informatics and Applications

Authors: Richard Královič

On the complexity of computable real sequences

JOURNAL ARTICLE published 1987 in RAIRO - Theoretical Informatics and Applications

Authors: Jacobo Torán

State complexity of cyclic shift

JOURNAL ARTICLE published April 2008 in RAIRO - Theoretical Informatics and Applications

Authors: Galina Jirásková | Alexander Okhotin

Towards parametrizing word equations

JOURNAL ARTICLE published July 2001 in RAIRO - Theoretical Informatics and Applications

Authors: H. Abdulrab | P. Goralčík | G. S. Makanin

Existence of an infinite ternary 64-abelian square-free word

JOURNAL ARTICLE published July 2014 in RAIRO - Theoretical Informatics and Applications

Authors: Mari Huova

On the Topological Complexity of Infinitary Rational Relations

JOURNAL ARTICLE published April 2003 in RAIRO - Theoretical Informatics and Applications

Authors: Olivier Finkel

On the parameterized complexity of approximate counting

JOURNAL ARTICLE published April 2011 in RAIRO - Theoretical Informatics and Applications

Authors: J. Andrés Montoya

Further results on generalized conditional entropies

JOURNAL ARTICLE published January 2015 in RAIRO - Theoretical Informatics and Applications

Authors: Alexey E. Rastegin

Uniformly growing backtrack trees

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: Rainer Kemp

Advice Complexity and Barely Random Algorithms

JOURNAL ARTICLE published April 2011 in RAIRO - Theoretical Informatics and Applications

Authors: Dennis Komm | Richard Královič

Communication Complexity and Lower Bounds on Multilective Computations

JOURNAL ARTICLE published March 1999 in RAIRO - Theoretical Informatics and Applications

Authors: Juraj Hromkovič

Upper bound for palindromic and factor complexity of rich words

JOURNAL ARTICLE published 2021 in RAIRO - Theoretical Informatics and Applications

Authors: Josef Rukavicka

Human-verifiable proofs in the theory of word-representable graphs

JOURNAL ARTICLE published 2024 in RAIRO - Theoretical Informatics and Applications

Authors: Sergey Kitaev | Haoran Sun

The complexity of weakly recognizing morphisms

JOURNAL ARTICLE published January 2019 in RAIRO - Theoretical Informatics and Applications

Authors: Lukas Fleischer | Manfred Kufleitner

Note on the complexity of Las Vegas automata problems

JOURNAL ARTICLE published July 2006 in RAIRO - Theoretical Informatics and Applications

Authors: Galina Jirásková

Detecting the morphic images of a word : improving the general algorithm

JOURNAL ARTICLE published 1997 in RAIRO - Theoretical Informatics and Applications

Authors: Jean Néraud

On universal partial words for word-patterns and set partitions

JOURNAL ARTICLE published 2020 in RAIRO - Theoretical Informatics and Applications

Research funded by National Natural Science Foundation of China (11901319) | Fundamental Research Funds for the Central Universities (63191349)

Authors: Herman Z.Q. Chen | Sergey Kitaev

On the syntactic complexity of tree series

JOURNAL ARTICLE published April 2010 in RAIRO - Theoretical Informatics and Applications

Authors: Symeon Bozapalidis | Antonios Kalampakas