Filter your results
- 13
- 12
- 1
- 13
- 3
- 2
- 2
- 4
- 2
- 13
- 1
- 1
- 9
- 5
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
NFA-to-DFA Trade-Off for Regular Operations21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.184-196, ⟨10.1007/978-3-030-23247-4_14⟩
Conference papers
hal-02387289v1
|
||
|
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
|
||
|
On the State Complexity of the Shuffle of Regular Languages18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.73-86, ⟨10.1007/978-3-319-41114-9_6⟩
Conference papers
hal-01633943v1
|
||
|
Square on Deterministic, Alternating, and Boolean Finite Automata19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.214-225, ⟨10.1007/978-3-319-60252-3_17⟩
Conference papers
hal-01657005v1
|
||
|
The Complexity of Languages Resulting from the Concatenation Operation18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.153-167, ⟨10.1007/978-3-319-41114-9_12⟩
Conference papers
hal-01633946v1
|
||
|
Descriptional Complexity of Formal SystemsSpringer International Publishing, LNCS-11612, 2019, Lecture Notes in Computer Science, 978-3-030-23246-7. ⟨10.1007/978-3-030-23247-4⟩
Books
hal-02387282v1
|
||
|
On Properties and State Complexity of Deterministic State-Partition Automata7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.164-178, ⟨10.1007/978-3-642-33475-7_12⟩
Conference papers
hal-01556220v1
|
||
|
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
|
||
|
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
|
||
|
State Complexity of Unambiguous Operations on Deterministic Finite Automata20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.188-199, ⟨10.1007/978-3-319-94631-3_16⟩
Conference papers
hal-01905641v1
|
||
|
Self-Verifying Finite Automata and Descriptional Complexity18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.29-44, ⟨10.1007/978-3-319-41114-9_3⟩
Conference papers
hal-01633958v1
|
||
|
Unrestricted State Complexity of Binary Operations on Regular Languages18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.60-72, ⟨10.1007/978-3-319-41114-9_5⟩
Conference papers
hal-01633951v1
|
||
|
On Union-Free and Deterministic Union-Free Languages7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.179-192, ⟨10.1007/978-3-642-33475-7_13⟩
Conference papers
hal-01556208v1
|