Cita APA (7a ed.)

Petrov, S., & Okhotin, A. (2024). A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata.

Cita Chicago Style (17a ed.)

Petrov, Semyon, y Alexander Okhotin. A Lower Bound on the State Complexity of Transforming Two-way Nondeterministic Finite Automata to Unambiguous Finite Automata. 2024.

Cita MLA (9a ed.)

Petrov, Semyon, y Alexander Okhotin. A Lower Bound on the State Complexity of Transforming Two-way Nondeterministic Finite Automata to Unambiguous Finite Automata. 2024.