Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

RAIRO - Theoretical Informatics and Applications, Volume 55

> 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 55, 2021

- view
  authority control:
- export record
  dblp key:
  - journals/ita/HolzerS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/HolzerS21
Markus Holzer, José M. Sempere:
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019). 1-2
- view
  authority control:
- export record
  dblp key:
  - journals/ita/Rukavicka21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/Rukavicka21
Josef Rukavicka:
Upper bound for palindromic and factor complexity of rich words. 1-15
- view
  authority control:
- export record
  dblp key:
  - journals/ita/Ruimy21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/Ruimy21
Anne Ruimy:
Publisher's Note. 1-2
- view
  authority control:
- export record
  dblp key:
  - journals/ita/TranL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/TranL21
Vinh Duc Tran, Igor Litovsky:
One-relation languages and code generators. 1-26
- view
  authority control:
- export record
  dblp key:
  - journals/ita/GabricS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/GabricS21
Daniel Gabric, Jeffrey O. Shallit:
The simplest binary word with only three squares. 1-7
- view
  authority control:
- export record
  dblp key:
  - journals/ita/AttouMZ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/AttouMZ21
Samira Attou, Ludovic Mignot, Djelloul Ziadi:
Bottom-Up derivatives of tree expressions. 1-21
- view
  authority control:
- export record
  dblp key:
  - journals/ita/NagyK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/NagyK21
Benedek Nagy, Zita Kovács:
On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers. 1-18
- view
  authority control:
- export record
  dblp key:
  - journals/ita/KutribM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/KutribM21
Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. 1-19
- view
  authority control:
- export record
  dblp key:
  - journals/ita/BruchertseiferF21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/BruchertseiferF21
Jens Bruchertseifer, Henning Fernau:
Synchronizing series-parallel deterministic finite automata with loops and related problems. 1-24
- view
  authority control:
- export record
  dblp key:
  - journals/ita/DassowT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/DassowT21
Jürgen Dassow, Bianca Truthe:
Accepting networks of evolutionary processors with resources restricted and structure limited filters. 1-27
- view
  authority control:
- export record
  dblp key:
  - journals/ita/MrazO21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/MrazO21
Frantisek Mráz, Friedrich Otto:
On restarting automata with auxiliary symbols and small window size. 1-31
- view
  authority control:
- export record
  dblp key:
  - journals/ita/MahdjoubiCAG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/MahdjoubiCAG21
Roumaissa Mahdjoubi, Pierre-Louis Cayrel, Sedat Akleylek, Kenza Guenda:
A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes. 1-16

a service of

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.