- Note: This article contains special characters.
Many of the Aheui's concept is derived from Befunge-93, except the fact that it has no instruction for self-modifying, and that it has 26 stacks and one queue.
This code prints "Hello, world!":
밣붍맣뱓몋두붖멓 뭏따맣불뽀뿌다맣 뭏누뻐쀀쀀쀀떠묳 붖다뭏다쀀쀀뽀도 뚜붇뱛몋도뼈타뭏 붖나빠밠다맣볼뵳 다맣맣희지민제작
 Computational class
Unlike Befunge-93, Aheui does not specify limit of codespace; however, Aheui does not use codespace as a storage. Aheui has additional stacks instead. Since a pair of unbounded stacks can be used to simulate the unbounded tape of a Turing machine, it is likely that Aheui is Turing-complete.
 Special characters
This article contains special characters that fall in the Hangul Syllable area of the Unicode charset. You need an appropriate font for the browser to display it correctly. Because Aheui is a two-dimensional language, using a monospacial Hangul font is highly recommended. (e.g. UnDotum)