Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters (2404.13254v1)
Abstract: Nonuniform families of polynomial-size finite automata and pushdown automata respectively have strong connections to nonuniform-NL and nonuniform-LOGCFL. We examine the behaviors of unambiguous and co-nondeterministic computations produced by such families of automata operating multiple counters. As its consequences, we obtain various collapses of the complexity classes of families of promise problems solvable by finite and pushdown automata families when all valid instances are limited to either polynomially long strings or unary strings. A key technical ingredient of our proofs is an inductive counting of reachable vertices of each computation graph of finite and pushdown automata that operate multiple counters simultaneously.
- V. Geffert. An alternating hierarchy for finite automata. Theor. Comput. Sci. 445, 1–24 (2012).
- V. Geffert and G. Pighizzini. Two-way unary automata versus logarithmic space. Inform. Comput. 209, 1016–1025 (2011)
- N. Immerman. Nondeterministic space is closed under complement. SIAM J. Comput. 17 (1988) 935–938.
- J. Hartmanis and S. R. Mahaney. Languages simultaneously complete for one-way and two-way log-tape automata. SIAM J. Comput. 10, 383–390 (1981)
- C. A. Kapoutsis. Minicomplexity. J. Automat. Lang. Combin. 17 (2012) 205–224.
- C. A. Kapoutsis. Two-way automata versus logarithmic space. Theory Comput. Syst. 55 (2014) 421–447.
- C. A. Kapoutsis and G. Pighizzini. Two-way automata characterizations of L/poly versus NL. Theory Comput. Syst. 56 (2015) 662–685.
- K. Reinhardt and E. Allender. Making nondeterminism unambiguous. SIAM J. Comput. 29, 1118–1181 (2000)
- W. J. Sakoda and M. Sipser. Nondeterminism and the size of two-way finite automata. In the Proc. of STOC 1978, pp. 275–286 (1978)
- R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Inform. 26 (1988) 279–284.
- T. Yamakami. Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. Inf. Comput. 286, article 104783 (2022)
- T. Yamakami. The 2CNF Boolean formula satsifiability problem and the linear space hypothesis. J. Comput. Syst. Sci. 136, 88–112 (2023)
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.