Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings /
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | eBook |
| Lenguaje: | English |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2017.
|
| Edición: | 1st ed. 2017. |
| Colección: | Theoretical Computer Science and General Issues ;
10316 |
| Materias: |
Tabla de Contenidos:
- Sensing as a Complexity Measure
- Avoiding Overlaps in Pictures
- Descriptional Complexity and Operations - Two non-Classical Cases
- Applications of Transducers in Independent Languages, Word Distances, Codes
- On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages
- On the Average Complexity of Strong Star Normal Form
- Most Complex Non-Returning Regular Languages
- Uncountable realtime probabilistic classes
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity
- Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
- Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
- Self-attraction removal from oritatami systems
- One-Time Nondeterministic Computations
- Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages
- Branching Measures and Nearly Acyclic NFAs
- Square on Deterministic, Alternating, and Boolean Finite Automata
- A Pumping Lemma for Ordered Restarting Automata
- Concise Representations of Reversible Automata
- State Complexity of Unary SV-XNFA with Different Acceptance Conditions
- Reset Complexity of Ideal Languages Over a Binary Alphabet
- 2-state 2-symbol Turing machines with periodic support produce regular sets
- State Complexity of Suffix Distance
- The quotient operation on input-driven pushdown automata.