Tome 55 (2021)

Sommaire

Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
article no. E1
Publisher’s Note
article no. E2
Upper Bound for Palindromic and Factor Complexity of Rich Words
article no. 1
One-Relation Languages and Code Generators
article no. 2
The Simplest Binary Word With Only Three Squares
article no. 3
Bottom-Up Derivatives of Tree Expressions
article no. 4
On Deterministic 1-Limited 5′ → 3′ Sensing Watson–Crick Finite-State Transducers
article no. 5
Digging Input-Driven Pushdown Automata
article no. 6
Synchronizing Series-Parallel Deterministic Finite Automata With Loops and Related Problems
article no. 7
Accepting Networks of Evolutionary Processors With Resources Restricted and Structure Limited Filters
article no. 8
On Restarting Automata With Auxiliary Symbols and Small Window Size
article no. 9
A Novel Niederreiter-Like Cryptosystem Based on the ( u | u + υ ) -Construction Codes
article no. 10
Complexity Issues of Perfect Secure Domination in Graphs
article no. 11