Fair sticker languages

@article{Hoogeboom2000FairSL,
  title={Fair sticker languages},
  author={Hendrik Jan Hoogeboom and Nike van Vugt},
  journal={Acta Informatica},
  year={2000},
  volume={37},
  pages={213-225}
}
Codings of fair sticker languages are characterized as languages accepted by blind one-counter automata. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 12 references

DNA Computing

Texts in Theoretical Computer Science • 1998

Molecular computationof solutions to combinatorial problems

L. E. Dickson
Science • 1994

Sticker systems

Gh. P̆aun
Revue Roumaine de Mathématiques Pures et Appliquées • 1980

Cônes rationnels commutatifs

J. Comput. Syst. Sci. • 1979