Formal languages over GF(2)

DOI10.1007/978-3-319-77313-1_5MaRDI QIDQ5915666zbMATH OpenOpenAlexFDO

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

Publication date 26 June 2018

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-77313-1_5

Mathematics Subject Classification ID

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

Recommendations

• On the expressive power of GF(2)-grammars
• State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages
• Mathematical Foundations of Computer Science 2004
• The dual of concatenation
• Universal disjunctive concatenation and star

Cited in

(11)

• State complexity of GF(2)-operations on unary languages
• On the expressive power of GF(2)-grammars
• State complexity of unambiguous operations on finite automata
• The dual of concatenation
• Notes on dual concatenation
• scientific article; zbMATH DE number 4028927 (Why is no real title available?)
• scientific article; zbMATH DE number 58302 (Why is no real title available?)
• Some properties on left-(n,2)-languages
• Formal languages over GF(2)
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages
• Bounded languages described by GF(2)-grammars

This page was built for publication: Formal languages over GF(2)

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