bibliographer - Semyon Petrov

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata Semyon Petrov Alexander Okhotin [github]

Library Size: 13G (1 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]