Filter your results
- 16
- 1
- 16
- 1
- 17
- 17
- 17
- 1
- 3
- 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
- 1
- 1
- 1
|
|
|
sorted by
|
|
|
Descriptional Complexity of Bounded Regular Languages18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.138-152, ⟨10.1007/978-3-319-41114-9_11⟩
Conference papers
hal-01633949v1
|
||
|
|
Operations on Weakly Recognizing Morphisms18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.126-137, ⟨10.1007/978-3-319-41114-9_10⟩
Conference papers
hal-01633955v1
|
||
|
|
Minimal and Reduced Reversible Automata18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.168-179, ⟨10.1007/978-3-319-41114-9_13⟩
Conference papers
hal-01633945v1
|
||
|
|
Contextual Array Grammars with Matrix and Regular Control18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.98-110, ⟨10.1007/978-3-319-41114-9_8⟩
Conference papers
hal-01633942v1
|
||
|
|
State Complexity of Prefix Distance of Subregular Languages18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.192-204, ⟨10.1007/978-3-319-41114-9_15⟩
Conference papers
hal-01633944v1
|
||
|
|
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
|
||
|
|
Unary Self-verifying Symmetric Difference Automata18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.180-191, ⟨10.1007/978-3-319-41114-9_14⟩
Conference papers
hal-01633957v1
|
||
|
|
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
|
||
|
|
Descriptional Complexity of Formal SystemsSpringer International Publishing, LNCS-9777, 2016, Lecture Notes in Computer Science, 978-3-319-41113-2. ⟨10.1007/978-3-319-41114-9⟩
Books
hal-01633947v1
|
||
|
|
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.45-59, ⟨10.1007/978-3-319-41114-9_4⟩
Conference papers
hal-01633952v1
|
||
|
|
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
|
||
|
|
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.18-28, ⟨10.1007/978-3-319-41114-9_2⟩
Conference papers
hal-01633954v1
|
||
|
|
Completely Reachable Automata18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.1-17, ⟨10.1007/978-3-319-41114-9_1⟩
Conference papers
hal-01633948v1
|
||
|
|
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
|
||
|
|
MSO-definable Properties of Muller Context-Free Languages Are Decidable18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.87-97, ⟨10.1007/978-3-319-41114-9_7⟩
Conference papers
hal-01633953v1
|
||
|
|
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.111-125, ⟨10.1007/978-3-319-41114-9_9⟩
Conference papers
hal-01633956v1
|
||
|
|
Two Results on Discontinuous Input Processing18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.205-216, ⟨10.1007/978-3-319-41114-9_16⟩
Conference papers
hal-01633950v1
|