Filter your results
- 2
- 2
- 2
- 2
- 2
- 2
- 1
|
|
|
sorted by
|
|
|
Most Complex Deterministic Union-Free Regular Languages20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.37-48, ⟨10.1007/978-3-319-94631-3_4⟩
Conference papers
hal-01905640v1
|
||
|
|
A New Technique for Reachability of States in Concatenation Automata20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.75-87, ⟨10.1007/978-3-319-94631-3_7⟩
Conference papers
hal-01905633v1
|