| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Binary and circular automata having maximal state complexity for the set of synchronizing words
|
Hoffmann, Stefan
|
|
|
295 |
PA |
p.
|
article
|
| 2 |
Editorial Board
|
|
|
|
295 |
PA |
p.
|
article
|
| 3 |
Eilenberg's variety theorem without Boolean operations
|
Birkmann, Fabian
|
|
|
295 |
PA |
p.
|
article
|
| 4 |
Finite-word hyperlanguages
|
Bonakdarpour, Borzoo
|
|
|
295 |
PA |
p.
|
article
|
| 5 |
Learnability and positive equivalence relations
|
Belanger, David
|
|
|
295 |
PA |
p.
|
article
|
| 6 |
Learning Mealy machines with one timer
|
Vaandrager, Frits
|
|
|
295 |
PA |
p.
|
article
|
| 7 |
Location automata for regular expressions with shuffle and intersection
|
Broda, Sabine
|
|
|
295 |
PA |
p.
|
article
|
| 8 |
New characterizations of primitive permutation groups with applications to synchronizing automata
|
Hoffmann, Stefan
|
|
|
295 |
PA |
p.
|
article
|
| 9 |
On hardest languages for one-dimensional cellular automata
|
Mrykhin, Mikhail
|
|
|
295 |
PA |
p.
|
article
|
| 10 |
On the transformation of two-way finite automata to unambiguous finite automata
|
Petrov, Semyon
|
|
|
295 |
PA |
p.
|
article
|
| 11 |
Special Issue: Selected papers of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021
|
MartÃn-Vide, Carlos
|
|
|
295 |
PA |
p.
|
article
|
| 12 |
Temporal logics with language parameters
|
Gutsfeld, Jens Oliver
|
|
|
295 |
PA |
p.
|
article
|
| 13 |
Usefulness of information and decomposability of unary regular languages
|
Pighizzini, Giovanni
|
|
|
295 |
PA |
p.
|
article
|
Journal description