State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages

DOI10.1007/978-3-030-23247-4_19MaRDI QIDQ2179341zbMATH OpenOpenAlexFDO

Authors Alexander Okhotin, Elizaveta Sazhneva

Publication date 12 May 2020

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1773089
• State complexity of some operations on binary regular languages
• The state complexities of some basic operations on regular languages
• scientific article; zbMATH DE number 2081044
• State complexity of operations on two-way deterministic finite automata over a unary alphabet

Cited in

(7)

• State complexity of GF(2)-operations on unary languages
• On the expressive power of GF(2)-grammars
• scientific article; zbMATH DE number 1773089 (Why is no real title available?)
• Formal languages over GF(2)
• Formal languages over GF(2)
• scientific article; zbMATH DE number 7770054 (Why is no real title available?)
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages

This page was built for publication: State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages

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