STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054105003157 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994383533 / rank
 
Normal rank

Latest revision as of 09:49, 30 July 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

    Identifiers