- Complementing two-way finite automata Viliam Geffert Carlo Mereghetti Giovanni Pighizzini Thu 26 January 2023
- Descriptional Complexity of Unambiguous Input-driven Pushdown Automata Alexander Okhotin Kai Salomaa Fri 08 June 2018
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity Georg Bachmeier Michael Luttenberger Maximilian Schlund Tue 12 January 2016
- Complementing Unary Nondeterministic Automata Filippo Mera Giovanni Pighizzini Thu 23 January 2014
Library Size: 13G (4 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
