Separating strings with small automata

Robson, J. M. (1989). Separating strings with small automata.

Type

Unclassified

Intellectual base

Unclassified

Year

1989

DOI

10.1016/0020-0190(89)90215-9

Link

https://doi.org/10.1016/0020-0190(89)90215-9

Cited by

1 citation across 1 artifact.

Domain-specific

• Separating words problem
  • … directly demonstrates that the resulting deterministic finite automaton yields different acceptance values for the two declared words and no smaller DFA under the same conventions does so. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..

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:29677c983c04 · see in the full table