STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4888749 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Composition sequences for functions over a finite domain. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The state complexities of some basic operations on regular languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata, Boolean matrices, and ultimate periodicity. / rank | |||
Normal rank | |||
Revision as of 14:29, 10 June 2024
scientific article; zbMATH DE number 2190072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET |
scientific article; zbMATH DE number 2190072 |
Statements
STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (English)
0 references
1 August 2005
0 references
