On a Conjecture by Christian Choffrut-Reference-Cited by-同舟云学术

On a Conjecture by Christian Choffrut

Published:2017-08 Issue:05 Volume:28 Page:483-501
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Belovs Aleksandrs¹,Montoya J. Andres²,Yakaryılmaz Abuzer¹

Affiliation:

1. Faculty of Computing, University of Latvia, Raina bulv. 19, Rīga, LV-1586, Latvia

2. Universidad Nacional de Colombia, Bogota, Colombia

Abstract

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054117400032

Reference11 articles.

1. Two-way finite automata with quantum and classical states

2. Communication Complexity

3. Quantum automata and quantum grammars

4. Quantum Computation and Quantum Information

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exclusive Affine Languages;Baltic Journal of Modern Computing;2022

2. Error-Free Affine, Unitary, and Probabilistic OBDDs;International Journal of Foundations of Computer Science;2021-05-12

3. Computational limitations of affine automata and generalized affine automata;Natural Computing;2021-01-18

4. Improved Constructions for Succinct Affine Automata;Descriptional Complexity of Formal Systems;2021

5. New Results on Vector and Homing Vector Automata;International Journal of Foundations of Computer Science;2019-12