scientific article; zbMATH DE number 3911710
From MaRDI portal
Publication:3687716
Recommendations
- On the power of alternation in automata theory
- On the power of P automata
- scientific article; zbMATH DE number 1696661
- On computational power of weighted finite automata
- scientific article; zbMATH DE number 871243
- On the computational power of affine automata
- An alternating hierarchy for finite automata
- On the power of P and dP automata
- On alternating \(\omega\)-automata
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction
Cited in
(17)- Alternating simple multihead finite automata
- Alternating multicounter machines with constant number of reversals
- On the power of alternation in automata theory
- Alternating multihead finite automata
- Alternation with a pebble
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction
- Square on deterministic, alternating, and Boolean finite automata
- One alternation can be more powerful than randomization in small and fast two-way finite automata
- scientific article; zbMATH DE number 4094826 (Why is no real title available?)
- An alternating hierarchy for finite automata
- scientific article; zbMATH DE number 3999320 (Why is no real title available?)
- scientific article; zbMATH DE number 862672 (Why is no real title available?)
- Gaining Power by Input Operations: Finite Automata and Beyond
- Square on Deterministic, Alternating, and Boolean Finite Automata
- On emptiness and counting for alternating finite automata
- Fuzzy alternating automata over distributive lattices
- Alternating finite automata with limited universal branching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687716)
