Formal Languages over GF(2)
Variants of the union and concatenation operations on formal languages are investigated, in which Boolean logic in the definitions (that is, conjunction and disjunction) is replaced with the operations in the two-element field GF(2) (conjunction and exclusive OR). Union is thus replaced with symmetric difference, whereas concatenation gives rise to a new GF(2)-concatenation operation, which is notable for being invertible. All operations preserve regularity, and their state complexity is determined. Next, a new class of formal grammars based on GF(2)-operations is defined, and it is shown to have the same computational complexity as ordinary grammars with union and concatenation.
- 2.Brent, R.P., Goldschlager, L.M.: A parallel algorithm for context-free parsing. Aust. Comp. Sci. Comm. 6(7), 1–10 (1984)Google Scholar
- 12.Rytter, W.: On the recognition of context-free languages. In: Computation Theory - Proceedings of 5th Symposium, Zaborów, Poland, 3–8 December 1984, pp. 318–325 (1984)Google Scholar