bibliographer - Olga Martynova

bibliographer a curated TCS bibliography

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

Nondeterministic tree-walking automata are not closed under complementation Olga Martynova Alexander Okhotin [github]

Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs Olga Martynova [github]

Non-closure under complementation for unambiguous linear grammars Olga Martynova Alexander Okhotin [github]

Lower Bounds for Graph-Walking Automata Olga Martynova Alexander Okhotin [github]

Library Size: 13G (4 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A

[show logs] [hide logs]