- This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by .
This is a example of a cyclic tag machine.
.A .F* .R NG-4 @=.*. @R @R @R @T .F* .R NG-4 @=**. @R @R @R @T .G17
This program will remove the vowels from the input.
.A @=~ .FA NFa NFE NFe NFI NFi NFO NFo NFU NFu YG-2 @R .G-1 .R .F~ @T NG17 .R @T .S