Description

Book Synopsis

.- Fibonacci Pictures on a Binary Alphabet.

.- A Close Analysis of the Subset Construction.

.- k-local Graphs.

.- Word-Representable Graphs and Locality of Words.

.- Automata for Synchronised Shuffle on Backbones.

.- Two-Word Shuffle: Some Results.

.- Matrix Forbidding Grammars.

.- On the Decidability and Expressive Power of Several Theories Based on String Constraints.

.- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete.

.- Disjunctive Complexity.

.- Two-Way Finite Automata with Translucent Input Letters.

.- Relative Densities of Formal Languages.

.- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words.

.- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?.

.- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.

Descriptional Complexity of Formal Systems

Product form

£98.99

Includes FREE delivery

RRP £109.99 – you save £11.00 (10%)

Order before 4pm tomorrow for delivery by Tue 20 Jan 2026.

A Paperback by Andreas Malcher

Out of stock


    View other formats and editions of Descriptional Complexity of Formal Systems by Andreas Malcher

    Publisher: Springer
    Publication Date: 7/28/2025
    ISBN13: 9783031970993, 978-3031970993
    ISBN10: 3031970993
    Also in:
    Mathematical theory of computation

    Description

    Book Synopsis

    .- Fibonacci Pictures on a Binary Alphabet.

    .- A Close Analysis of the Subset Construction.

    .- k-local Graphs.

    .- Word-Representable Graphs and Locality of Words.

    .- Automata for Synchronised Shuffle on Backbones.

    .- Two-Word Shuffle: Some Results.

    .- Matrix Forbidding Grammars.

    .- On the Decidability and Expressive Power of Several Theories Based on String Constraints.

    .- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete.

    .- Disjunctive Complexity.

    .- Two-Way Finite Automata with Translucent Input Letters.

    .- Relative Densities of Formal Languages.

    .- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words.

    .- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?.

    .- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account