RAIRO Theor. Informatics Appl.

Keyphrases

Publications

volume 57, 2023

Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang
Automatic sequences in negative bases and proofs of some conjectures of shevelev. RAIRO Theor. Informatics Appl. 57 (2023)
Jürgen Dassow, Bianca Truthe
Relations of contextual grammars with strictly locally testable selection languages. RAIRO Theor. Informatics Appl. 57 (2023)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
On the computational difficulty of the terminal connection problem. RAIRO Theor. Informatics Appl. 57 (2023)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57 (2023)
Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla
On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Informatics Appl. 57 (2023)
Eric Freden, Kevin Martinsen
EDT0L grammars with only one variable have tractable generating functions. RAIRO Theor. Informatics Appl. 57 (2023)
Chunlei Xu, Guanru Li
Maximum values of sombor index of bicyclic graphs with a given matching number. RAIRO Theor. Informatics Appl. 57 (2023)
Sébastien Labbé, Jana Lepsová
A Fibonacci analogue of the two's complement numeration system. RAIRO Theor. Informatics Appl. 57 (2023)
Frantisek Mráz, Friedrich Otto
Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO Theor. Informatics Appl. 57 (2023)
Massoud Amini, Jumah Swid
Strongly recurrent transformation groups. RAIRO Theor. Informatics Appl. 57 (2023)
Christian Rauch, Markus Holzer
On the accepting state complexity of operations on permutation automata. RAIRO Theor. Informatics Appl. 57 (2023)
Mina Ghasemi, Mehri Javanian, Ramin Imany-Nabiyyi
-ary trees. RAIRO Theor. Informatics Appl. 57 (2023)

volume 56, 2022

volume 55, 2021

volume 54, 2020

volume 53, number 1-2, 2019

volume 53, number 3-4, 2019

volume 52, number 2-3-4, 2018

Radim Kocman, Zbynek Krivka, Alexander Meduna
On double-jumping finite automata and their closure properties. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)