Descriptional Complexity of Formal Systems

13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings

Editors:

ISBN: 978-3-642-22599-4 (Print) 978-3-642-22600-7 (Online)

Table of contents (25 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Papers

    1. No Access

      Book Chapter

      Pages 1-7

      Linear Algebra Based Bounds for One-Dimensional Cellular Automata

    2. No Access

      Book Chapter

      Pages 8-33

      On Restarting Automata with Window Size One

    3. No Access

      Book Chapter

      Pages 34-42

      Construction and SAT-Based Verification of Contextual Unfoldings

    4. No Access

      Book Chapter

      Pages 43-54

      The Power of Diversity

  3. Regular Papers

    1. No Access

      Book Chapter

      Pages 55-67

      Decidability and Shortest Strings in Formal Languages

    2. No Access

      Book Chapter

      Pages 68-79

      On the Degree of Team Cooperation in CD Grammar Systems

    3. No Access

      Book Chapter

      Pages 80-92

      The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata

    4. No Access

      Book Chapter

      Pages 93-106

      Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages

    5. No Access

      Book Chapter

      Pages 107-120

      Geometrical Regular Languages and Linear Diophantine Equations

    6. No Access

      Book Chapter

      Pages 121-134

      On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems

    7. No Access

      Book Chapter

      Pages 135-146

      On Contextual Grammars with Subregular Selection Languages

    8. No Access

      Book Chapter

      Pages 147-157

      Remarks on Separating Words

    9. No Access

      Book Chapter

      Pages 158-171

      State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal

    10. No Access

      Book Chapter

      Pages 172-183

      k-Local Internal Contextual Grammars

    11. No Access

      Book Chapter

      Pages 184-197

      On Synchronized Multitape and Multihead Automata

    12. No Access

      Book Chapter

      Pages 198-211

      State Complexity of Projected Languages

    13. No Access

      Book Chapter

      Pages 212-221

      Note on Reversal of Binary Regular Languages

    14. No Access

      Book Chapter

      Pages 222-234

      State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet

    15. No Access

      Book Chapter

      Pages 235-247

      Kleene Theorems for Product Systems

    16. No Access

      Book Chapter

      Pages 248-260

      Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals

previous Page of 2