State complexity of GF(2)-operations on unary languages

DOI10.1016/j.ic.2021.104693OpenAlexW3120719177MaRDI QIDQ2113387

Alexander Okhotin, Elizaveta Sazhneva

Publication date: 14 March 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104693

zbMATH Keywords

state complexityprimitive polynomialsGF(2)-concatenationGF(2)-inverseGF(2)-star

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

\(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unambiguous finite automata over a unary alphabet
• The state complexities of some basic operations on regular languages
• Converting two-way nondeterministic unary automata into simpler automata.
• State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages
• On the expressive power of GF(2)-grammars
• State complexity of unambiguous operations on finite automata
• Optimal Simulations between Unary Automata
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• Ambiguity of Unary Symmetric Difference NFAs
• Minimal DFA for Symmetric Difference NFA
• Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
• Formal languages over GF(2)
• Formal languages over GF(2)

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