On a conjecture by Christian Choffrut
From MaRDI portal
Recommendations
Cites work
- About Goto's method showing surjectivity of word maps
- Affine computation and affine automaton
- Communication Complexity
- Convergent Sequences in Discrete Groups
- Counting with probabilistic and ultrametric finite automata
- scientific article; zbMATH DE number 3956447 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- Languages recognized by nondeterministic quantum finite automata
- Looking for Pairs that Hard to Separate: A Quantum Approach
- Notes on counting with finite machines
- On free subgroups of semi-simple groups
- Probabilistic automata
- Quantum automata and quantum grammars
- Quantum computation and quantum information. 10th anniversary edition
- Quantum finite automata: a modern introduction
- Remarks on separating words
- Separating strings with small automata
- Superiority of exact quantum automata for promise problems
- Two-way finite automata with quantum and classical states.
- Ultrametric finite automata and Turing machines
- Unbounded-error quantum computation with small space bounds
Cited in
(8)- On the gap between separating words and separating their reversals
- Improved constructions for succinct affine automata
- New results on vector and homing vector automata
- On Christol’s conjecture
- Computational limitations of affine automata and generalized affine automata
- Error-Free Affine, Unitary, and Probabilistic OBDDs
- Real-valued affine automata compute beyond Turing machines
- On Christensen's conjecture
This page was built for publication: On a conjecture by Christian Choffrut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605510)
