An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections (Q1256319)
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 3626613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections |
scientific article; zbMATH DE number 3626613 |
Statements
An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections (English)
0 references
1977
0 references
Finite-State Complexity
0 references
Generating Schemes
0 references
Multigraph
0 references
Finite Automata
0 references
Regular Set
0 references
Boolean Function
0 references
