Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters
From MaRDI portal
Publication:6636064
DOI10.1007/978-981-97-2340-9_2MaRDI QIDQ6636064
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An alternating hierarchy for finite automata
- Two-way unary automata versus logarithmic space
- The method of forced enumeration for nondeterministic automata
- Two-way automata versus logarithmic space
- Two-way automata characterizations of L/poly versus NL
- Complementing two-way finite automata
- Size Complexity of Two-Way Finite Automata
- Nondeterministic Space is Closed under Complementation
- Two Applications of Inductive Counting for Complementation Problems
- Making Nondeterminism Unambiguous
- Nondeterminism and the size of two way finite automata
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata
- Power of counting by nonuniform families of polynomial-size finite automata
This page was built for publication: Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636064)
