Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata

von Yamakami, Tomoyukt
Veröffentlicht in RP (16. : 2022 : Kaiserslautern) Reachability problems (2022)

Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata

von Yamakami, Tomoyukt
Veröffentlicht in COCOON (27. : 2021 : Tainan) Computing and Combinatorics (2021)