Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Layered memory automata: recognizers for quasi-regular languages with unbounded memory |
scientific article; zbMATH DE number 7573254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Layered memory automata: recognizers for quasi-regular languages with unbounded memory |
scientific article; zbMATH DE number 7573254 |
Statements
Layered memory automata: recognizers for quasi-regular languages with unbounded memory (English)
0 references
19 August 2022
0 references
data languages
0 references
memory automata
0 references
register automata
0 references
unbounded memory
0 references
quasi-regular languages
0 references
0.7069587707519531
0 references
0.701973021030426
0 references
0.6997470259666443
0 references
0.6893149614334106
0 references
0.6844872832298279
0 references
