{
  "format": "automata-studio/workspace",
  "schema": 1,
  "app": "dev",
  "machine": "DFA",
  "config": {
    "sym": {
      "eps": "ε",
      "any": "Σ",
      "blank": "⊔",
      "leftMarker": "⊢",
      "rightMarker": "⊣",
      "stackBottom": "Z",
      "lambda": "λ"
    }
  },
  "sigma": [
    "0",
    "1"
  ],
  "stackAlpha": [],
  "outputAlpha": [],
  "tapeCount": 1,
  "states": [
    {
      "id": "s1",
      "x": 140,
      "y": 160,
      "name": "none"
    },
    {
      "id": "s2",
      "x": 319,
      "y": 160,
      "name": "one"
    },
    {
      "id": "s3",
      "x": 498,
      "y": 160,
      "name": "oneone"
    }
  ],
  "transitions": [
    {
      "id": "t1",
      "from": "s1",
      "to": "s1",
      "symbol": "0"
    },
    {
      "id": "t2",
      "from": "s1",
      "to": "s2",
      "symbol": "1"
    },
    {
      "id": "t3",
      "from": "s2",
      "to": "s1",
      "symbol": "0"
    },
    {
      "id": "t4",
      "from": "s2",
      "to": "s3",
      "symbol": "1"
    },
    {
      "id": "t5",
      "from": "s3",
      "to": "s3",
      "symbol": "1"
    }
  ],
  "startId": "s1",
  "accepts": [
    "s1",
    "s2",
    "s3"
  ],
  "notes": [],
  "dividers": [],
  "blocks": [],
  "meta": {
    "title": "Never contains 110",
    "blurb": "Once 11 has been read, a 0 would complete the forbidden pattern and every further 1 keeps the danger alive — so the state after 11 has a self-loop on 1 and no way out on 0.",
    "inputs": [
      {
        "w": "",
        "expect": "accept"
      },
      {
        "w": "10011",
        "expect": "accept"
      },
      {
        "w": "0",
        "expect": "accept"
      },
      {
        "w": "0000001011",
        "expect": "accept"
      },
      {
        "w": "11011",
        "expect": "reject"
      },
      {
        "w": "0000011011",
        "expect": "reject"
      },
      {
        "w": "110",
        "expect": "reject"
      },
      {
        "w": "00110",
        "expect": "reject"
      }
    ],
    "library": {
      "author": {
        "login": "thethinkmachine"
      },
      "license": "CC-BY-4.0",
      "tags": [
        "textbook",
        "sipser",
        "forbidden-pattern",
        "partial-dfa"
      ],
      "difficulty": "intro",
      "chapter": "Sipser, Introduction to the Theory of Computation, exercises to chapter 1"
    }
  }
}
