(01-02-2025, 01:30 AM)Bluetoes101 wrote: You are not allowed to view links. Register or Login to view.3) Does your system only consider individual glyphs? So, all the rules are like "glyph of type X is followed by glyph of type Y" and never "a combination of glyphs AB is followed by a glyph of type Y".
It only checks pairs until you "switch", then it tracks what you switched from and to and if that sequence conforms.
You can have an extra switch (following a switch, only) which does nothing functional but is allowed, so technically it tracks up to 4 glyphs. 3 switches is considered a non-conformance, so it can never get past 4 and conform.
Ok, it's more complex than I thought. Let's try to see whether we can express this as a grammar.
What is "a switch"? Is this a specific character (like EVA a) or just a point in the sequence where one type of characters changes to another type of characters?
(01-02-2025, 01:30 AM)Bluetoes101 wrote: You are not allowed to view links. Register or Login to view.4) Is it possible to fully describe the rules of your system by using a square table where there is one column and one row for each glyph and the table is filled by Y and N denoting whether the column glyph can appear immediately after the row glyph?
I think so. I best think in pictures to be honest, I see it like a simple electronic circuit diagram.
Currently there are 4 groups.
3 can move to 1 other place, or stay and do another of them self (to a limit) then be forced to change or end.
1 can not do another of itself but move 2 ways, or end.
Pictures will do! I love pictures.
Can this whole system be expressed as a directional graph? Something like this?