Descriptional Complexity of Formal Systems: 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
Markus Holzer, Martin Kutrib, Giovanni Pighizzini
Springer Science & Business Media, Jul 18, 2011 - Computers - 329 pages
This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) objects; state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov complexity.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
1DFA 2DFA algorithm binary Boolean circuit CD grammar system CD-systems class of languages clustered components Computer Science configuration consider constant height dpda construction contains context-free corresponding crossing sequences crossing systems cycle DCFS deﬁned denote descriptional complexity deterministic finite automaton dpda DTA(DFA equivalent exists finite automata given graph gridlines head Holzer incomplete dfa initial input integer internal contextual grammar k-synchronized Kutrib labeled Lemma length linear LNCS lower bound membrane minimal DFA monoid multitape n-state DFA n-tape node nondeterministic nonterminals NPDA number of vertical obtained operations Petri nets polynomial prefix problem Proof Proposition query symbols quotient reachable recursively enumerable language regular languages resp restarting automata result reversal rules Salomaa sentential form simulation Springer step string strongly connected strongly connected graph tape Theorem trade-offs transformation transition function tree language Turing machine two-way unary languages upper bound word