science
plus
.abes.fr
|
explorer
À propos de :
http://hub.abes.fr/edp/periodical/ita/2021/volume_55/issue_2021/w
Goto
Sponge
NotDistinct
Permalink
An Entity of Type :
bibo:Issue
, within Data Space :
scienceplus.abes.fr
associated with source
document(s)
Type:
work
Issue
New Facet based on Instances of this Class
Attributs
Valeurs
type
work
Issue
Is Part Of
http://hub.abes.fr/edp/periodical/ita/2021/volume_55
has manifestation of work
http://hub.abes.fr/edp/periodical/ita/2021/volume_55/issue_2021/m/print
http://hub.abes.fr/edp/periodical/ita/2021/volume_55/issue_2021/m/web
publisher identifier
ita/2021/01
is
Is Part Of
of
Upper bound for palindromic and factor complexity of rich words
On restarting automata with auxiliary symbols and small window size
Digging input-driven pushdown automata
Bottom-Up derivatives of tree expressions
Accepting networks of evolutionary processors with resources restricted and structure limited filters
On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers
Synchronizing series-parallel deterministic finite automata with loops and related problems
One-relation languages and code generators
Complexity issues of perfect secure domination in graphs
The simplest binary word with only three squares
A Novel Niederreiter-like cryptosystem based on the ( u| u + υ)-construction codes
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
Publisher’s Note
Alternative Linked Data Documents:
ODE
Content Formats:
RDF
ODATA
Microdata
