Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters
From MaRDI portal
Publication:6636064
Cites work
- scientific article; zbMATH DE number 3568031 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- An alternating hierarchy for finite automata
- Complementing two-way finite automata
- Making Nondeterminism Unambiguous
- Minicomplexity
- Nondeterminism and the size of two way finite automata
- Nondeterministic Space is Closed under Complementation
- Power of counting by nonuniform families of polynomial-size finite automata
- Size Complexity of Two-Way Finite Automata
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
- The method of forced enumeration for nondeterministic automata
- Two Applications of Inductive Counting for Complementation Problems
- Two-way automata characterizations of L/poly versus NL
- Two-way automata versus logarithmic space
- Two-way unary automata versus logarithmic space
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic 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)
