default search action

combined dblp search
author search
venue search
publication search

ask others

RAIRO - Theoretical Informatics and Applications, Volume 57

> Home > Journals > RAIRO - Theoretical Informatics and Applications

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 57, 2023

- view
  authority control:
- export record
  dblp key:
  - journals/ita/CurrieORS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/CurrieORS23
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Properties of a ternary infinite word. 1
- view
  authority control:
- export record
  dblp key:
  - journals/ita/AminiS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/AminiS23
Massoud Amini, Jumah Swid:
Strongly recurrent transformation groups. 2
- view
  authority control:
- export record
  dblp key:
  - journals/ita/MeloFS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/MeloFS23
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the computational difficulty of the terminal connection problem. 3
- view
  authority control:
- export record
  dblp key:
  - journals/ita/ShallitSY23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/ShallitSY23
Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang:
Automatic sequences in negative bases and proofs of some conjectures of shevelev. 4
- view
  authority control:
- export record
  dblp key:
  - journals/ita/GhasemiJI23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/GhasemiJI23
Mina Ghasemi, Mehri Javanian, Ramin Imany-Nabiyyi:
Note on the exponential recursive k-ary trees. 5
- view
  authority control:
- export record
  dblp key:
  - journals/ita/FredenM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/FredenM23
Eric Freden, Kevin Martinsen:
EDT0L grammars with only one variable have tractable generating functions. 6
- view
  authority control:
- export record
  dblp key:
  - journals/ita/FinkelHHS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/FinkelHHS23
Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla:
On bi-infinite and conjugate post correspondence problems. 7
- view
  authority control:
- export record
  dblp key:
  - journals/ita/MrazO23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/MrazO23
Frantisek Mráz, Friedrich Otto:
Non-returning deterministic and nondeterministic finite automata with translucent letters. 8
- view
  authority control:
- export record
  dblp key:
  - journals/ita/RauchH23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/RauchH23
Christian Rauch, Markus Holzer:
On the accepting state complexity of operations on permutation automata. 9
- view
  authority control:
- export record
  dblp key:
  - journals/ita/DassowT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/DassowT23
Jürgen Dassow, Bianca Truthe:
Relations of contextual grammars with strictly locally testable selection languages. 10
- view
  authority control:
- export record
  dblp key:
  - journals/ita/XuL23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/XuL23
Chunlei Xu, Guanru Li:
Maximum values of sombor index of bicyclic graphs with a given matching number. 11
- view
  authority control:
- export record
  dblp key:
  - journals/ita/LabbeL23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/LabbeL23
Sébastien Labbé, Jana Lepsová:
A Fibonacci analogue of the two's complement numeration system. 12

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.