Bounded languages described by GF(2)-grammars

DOI10.1007/978-3-030-81508-0_23MaRDI QIDQ832949zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 3677223 (Why is no real title available?)
• Ambiguity in context free languages
• Analytic models and ambiguity of context-free languages
• Automatic Sequences
• Bounded Algol-Like Languages
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Formal languages over GF(2)
• On the expressive power of GF(2)-grammars
• Semigroups, Presburger formulas, and languages

Cited in

(4)

• Non-closure under complementation for unambiguous linear grammars
• scientific article; zbMATH DE number 7770054 (Why is no real title available?)
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages
• Bounded D0L languages

Describes a project that uses

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)