On A Conjecture By Christian Choffrut
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE(2017)
摘要
It is one of the most famous open problems to determine the minimum amount of states required by a deterministic finite automaton to distinguish a pair of strings, which was stated by Christian Choffrut more than thirty years ago.We investigate the same question for different automata models and we obtain new upper and lower bounds for some of them including alternating, ultrametric, quantum, and affine finite automata.
更多查看译文
关键词
Alternating automaton, ultrametric automaton, quantum automaton, affine automaton, state complexity, counting problem, zero-error, nondeterminism, promise problems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要