Boolean monadic recursive schemes as a logical characterization of the subsequential functions (Q782569)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7225121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Boolean monadic recursive schemes as a logical characterization of the subsequential functions |
scientific article; zbMATH DE number 7225121 |
Statements
Boolean monadic recursive schemes as a logical characterization of the subsequential functions (English)
0 references
27 July 2020
0 references
subsequential functions
0 references
logic
0 references
recursive program schemes
0 references
finite automata
0 references
0.7258115410804749
0 references
0.711548924446106
0 references
0.6966090798377991
0 references
