Filter your results
- 21
- 21
- 1
- 21
- 21
- 21
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Generalized de Bruijn Words and the State Complexity of Conjugate Sets21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.137-146, ⟨10.1007/978-3-030-23247-4_10⟩
Conference papers
hal-02387301v1
|
||
|
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
|
||
|
Pushdown Automata and Constant Height: Decidability and Bounds21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.260-271, ⟨10.1007/978-3-030-23247-4_20⟩
Conference papers
hal-02387302v1
|
||
|
Descriptional Complexity of Iterated Uniform Finite-State Transducers21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.223-234, ⟨10.1007/978-3-030-23247-4_17⟩
Conference papers
hal-02387284v1
|
||
|
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.248-259, ⟨10.1007/978-3-030-23247-4_19⟩
Conference papers
hal-02387287v1
|
||
|
The Syntactic Complexity of Semi-flower Languages21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.147-157, ⟨10.1007/978-3-030-23247-4_11⟩
Conference papers
hal-02387298v1
|
||
|
Regulated Tree Automata21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.124-136, ⟨10.1007/978-3-030-23247-4_9⟩
Conference papers
hal-02387294v1
|
||
|
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
|
||
|
Square, Power, Positive Closure, and Complementation on Star-Free Languages21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.98-110, ⟨10.1007/978-3-030-23247-4_7⟩
Conference papers
hal-02387295v1
|
||
|
Descriptional Complexity of Matrix Simple Semi-conditional Grammars21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.111-123, ⟨10.1007/978-3-030-23247-4_8⟩
Conference papers
hal-02387307v1
|
||
|
On Classes of Regular Languages Related to Monotone WQOs21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.235-247, ⟨10.1007/978-3-030-23247-4_18⟩
Conference papers
hal-02387304v1
|
||
|
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.158-170, ⟨10.1007/978-3-030-23247-4_12⟩
Conference papers
hal-02387306v1
|
||
|
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.285-297, ⟨10.1007/978-3-030-23247-4_22⟩
Conference papers
hal-02387305v1
|
||
|
Nondeterminism Growth and State Complexity21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.210-222, ⟨10.1007/978-3-030-23247-4_16⟩
Conference papers
hal-02387283v1
|
||
|
State Complexity of Simple Splicing21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.197-209, ⟨10.1007/978-3-030-23247-4_15⟩
Conference papers
hal-02387296v1
|
||
|
Low-Complexity Tilings of the Plane21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.35-45, ⟨10.1007/978-3-030-23247-4_2⟩
Conference papers
hal-02387291v1
|
||
|
On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.272-284, ⟨10.1007/978-3-030-23247-4_21⟩
Conference papers
hal-02387299v1
|
||
|
Limited Automata: Properties, Complexity and Variants21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.57-73, ⟨10.1007/978-3-030-23247-4_4⟩
Conference papers
hal-02387288v1
|
||
|
A General Framework for Sequential Grammars with Control Mechanisms21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.1-34, ⟨10.1007/978-3-030-23247-4_1⟩
Conference papers
hal-02387286v1
|
||
|
Union-Freeness, Deterministic Union-Freeness and Union-Complexity21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.46-56, ⟨10.1007/978-3-030-23247-4_3⟩
Conference papers
hal-02387293v1
|
||
|
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.74-85, ⟨10.1007/978-3-030-23247-4_5⟩
Conference papers
hal-02387300v1
|