Filter your results
- 24
- 1
- 24
- 1
- 25
- 25
- 25
- 1
- 1
- 1
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Reset Complexity of Ideal Languages Over a Binary Alphabet19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.262-273, ⟨10.1007/978-3-319-60252-3_21⟩
Conference papers
hal-01656997v1
|
||
|
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.140-151, ⟨10.1007/978-3-319-60252-3_11⟩
Conference papers
hal-01657015v1
|
||
|
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.189-201, ⟨10.1007/978-3-319-60252-3_15⟩
Conference papers
hal-01657013v1
|
||
|
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 Quotient Operation on Input-Driven Pushdown Automata19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.299-310, ⟨10.1007/978-3-319-60252-3_24⟩
Conference papers
hal-01657008v1
|
||
|
Descriptional Complexity of Formal SystemsSpringer International Publishing, LNCS-10316, 2017, Lecture Notes in Computer Science, 978-3-319-60251-6. ⟨10.1007/978-3-319-60252-3⟩
Books
hal-01656999v1
|
||
|
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.128-139, ⟨10.1007/978-3-319-60252-3_10⟩
Conference papers
hal-01657011v1
|
||
|
A Parametrized Analysis of Algorithms on Hierarchical Graphs19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.114-127, ⟨10.1007/978-3-319-60252-3_9⟩
Conference papers
hal-01657006v1
|
||
|
Sensing as a Complexity Measure19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.3-15, ⟨10.1007/978-3-319-60252-3_1⟩
Conference papers
hal-01657019v1
|
||
|
State Complexity of Suffix Distance19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.287-298, ⟨10.1007/978-3-319-60252-3_23⟩
Conference papers
hal-01656995v1
|
||
|
On the Average Complexity of Strong Star Normal Form19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.77-88, ⟨10.1007/978-3-319-60252-3_6⟩
Conference papers
hal-01657014v1
|
||
|
Descriptional Complexity and Operations – Two Non-classical Cases19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.33-44, ⟨10.1007/978-3-319-60252-3_3⟩
Conference papers
hal-01657004v1
|
||
|
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.274-286, ⟨10.1007/978-3-319-60252-3_22⟩
Conference papers
hal-01657010v1
|
||
|
State Complexity of Unary SV-XNFA with Different Acceptance Conditions19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.250-261, ⟨10.1007/978-3-319-60252-3_20⟩
Conference papers
hal-01657002v1
|
||
|
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
|
||
|
One-Time Nondeterministic Computations19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.177-188, ⟨10.1007/978-3-319-60252-3_14⟩
Conference papers
hal-01657018v1
|
||
|
Branching Measures and Nearly Acyclic NFAs19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.202-213, ⟨10.1007/978-3-319-60252-3_16⟩
Conference papers
hal-01657000v1
|
||
|
Applications of Transducers in Independent Languages, Word Distances, Codes19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.45-62, ⟨10.1007/978-3-319-60252-3_4⟩
Conference papers
hal-01657012v1
|
||
|
Concise Representations of Reversible Automata19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.238-249, ⟨10.1007/978-3-319-60252-3_19⟩
Conference papers
hal-01657009v1
|
||
|
Avoiding Overlaps in Pictures19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.16-32, ⟨10.1007/978-3-319-60252-3_2⟩
Conference papers
hal-01657001v1
|
||
|
On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.65-76, ⟨10.1007/978-3-319-60252-3_5⟩
Conference papers
hal-01657017v1
|
||
|
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.152-163, ⟨10.1007/978-3-319-60252-3_12⟩
Conference papers
hal-01657003v1
|
||
|
A Pumping Lemma for Ordered Restarting Automata19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.226-237, ⟨10.1007/978-3-319-60252-3_18⟩
Conference papers
hal-01656996v1
|
||
|
Uncountable Realtime Probabilistic Classes19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.102-113, ⟨10.1007/978-3-319-60252-3_8⟩
Conference papers
hal-01657007v1
|
||
|
Self-attraction Removal from Oritatami Systems19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.164-176, ⟨10.1007/978-3-319-60252-3_13⟩
Conference papers
hal-01657016v1
|