David Casas

Orcid: 0000-0002-0544-6269

According to our database1, David Casas authored at least 5 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Don's Conjecture for Binary Completely Reachable Automata: an Approach and its Limitations.
J. Autom. Lang. Comb., 2024

2023
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees.
Int. J. Found. Comput. Sci., September, 2023

2022
Completely reachable automata: an interplay between automata, graphs, and trees.
CoRR, 2022

Binary Completely Reachable Automata.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2015
On the real-state processing of regular operations and the Sakoda-Sipser problem.
Proceedings of the 2015 Latin American Computing Conference, 2015


  Loading...