Bounded languages described by GF(2)-grammars

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

Authors: 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)

Cites Work

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

Cited In (4)

• Non-closure under complementation for unambiguous linear grammars
• Title not available (Why is that?)
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages
• Bounded D0L languages

Uses Software

• ALGOL 60

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832949)