Filter your results
- 4
- 4
- 4
- 1
- 2
- 1
- 4
- 1
- 1
- 4
- 3
- 1
|
|
|
sorted by
|
|
|
State Complexity of Single-Word Pattern Matching in Regular Languages21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.86-97, ⟨10.1007/978-3-030-23247-4_6⟩
Conference papers
hal-02387297v1
|
||
|
|
Most Complex Non-returning Regular Languages19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.89-101, ⟨10.1007/978-3-319-60252-3_7⟩
Conference papers
hal-01656998v1
|
||
|
|
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
|