Formal Languages over GF(2)

Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva

Research output

8 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings
PublisherSpringer Nature
Number of pages12
ISBN (Print)9783319773124
Publication statusPublished - 1 Jan 2018
Event12th International Conference on Language and Automata Theory and Applications, LATA 2018 - Ramat Gan
Duration: 9 Apr 201811 Apr 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10792 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Conference on Language and Automata Theory and Applications, LATA 2018
CityRamat Gan

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Formal Languages over GF(2)'. Together they form a unique fingerprint.

Cite this