On the expressive power of GF(2)-grammars

DOI10.1007/978-3-030-10801-4_25zbMath1445.68120OpenAlexW2909642410MaRDI QIDQ2206237

Vladislav Makarov, Alexander Okhotin

Publication date: 22 October 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-10801-4_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

Bounded languages described by GF(2)-grammars ⋮ The Hardest LL(k) Language ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Unnamed Item ⋮ Formal languages over GF(2) ⋮ State complexity of GF(2)-operations on unary languages

This page was built for publication: On the expressive power of GF(2)-grammars