Bounded languages described by GF(2)-grammars

DOI10.1007/978-3-030-81508-0_23OpenAlexW3198739773MaRDI QIDQ832949

Vladislav Makarov

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/1912.13401

zbMATH Keywords

finite fieldsbounded languagesformal grammarsinherent ambiguityunambiguous grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Non-closure under complementation for unambiguous linear grammars ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Unnamed Item

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Analytic models and ambiguity of context-free languages
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• On the expressive power of GF(2)-grammars
• Semigroups, Presburger formulas, and languages
• Automatic Sequences
• Ambiguity in context free languages
• Bounded Algol-Like Languages
• Formal languages over GF(2)

This page was built for publication: Bounded languages described by GF(2)-grammars