Characterizing Regular Languages with Polynomial Densities

Szilard, A., Yu, S., Zhang, K., & Shallit, J. (1992). Characterizing Regular Languages with Polynomial Densities. MFCS 1992.

Type

Book chapter

Intellectual base

Review or monograph

Year

1992

DOI

10.1007/3-540-55808-x_48

ISBN

9783540558088

Link

https://doi.org/10.1007/3-540-55808-X_48

Cited by

1 citation across 1 artifact.

Domain-specific

• Factor Complexity Function
  • This shared cardinality operator is coherent, but the distinction matters: a factor language is closed under taking factors and extension constraints link its length slices, while an arbitrary language need not have either property.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b43d630a291e · see in the full table