"regular language" meaning in English

{
  "forms": [
    {
      "form": "regular languages",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "regular language (plural regular languages)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2007, Dick Grune, Ceriel J.H. Jacobs, Parsing Techniques: A Practical Guide, Springer Science & Business Media, →ISBN, page 152:",
          "text": "There is an interesting way to get the negation (complement) of a regular language L defined by a FS automaton, provided the automaton is ε-free.",
          "type": "quote"
        },
        {
          "ref": "2014, Brian MacWhinney, William O'Grady, The Handbook of Language Emergence, John Wiley & Sons, →ISBN, page 393:",
          "text": "A regular language is one that can be generated by a regular grammar or finite-state automaton, the lowest level of the Chomsky hierarchy. It is well known that these grammars are inadequate to represent natural language syntax.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A formal language that can be expressed using a regular expression or finite-state machine."
      ],
      "id": "en-regular_language-en-noun-Teh3D6Cn",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "formal language",
          "formal language"
        ],
        [
          "regular expression",
          "regular expression"
        ],
        [
          "finite-state machine",
          "finite-state machine"
        ]
      ],
      "raw_glosses": [
        "(computer science) A formal language that can be expressed using a regular expression or finite-state machine."
      ],
      "related": [
        {
          "word": "regular expression"
        }
      ],
      "synonyms": [
        {
          "word": "rational language"
        }
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "regular language"
}

{
  "forms": [
    {
      "form": "regular languages",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "regular language (plural regular languages)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "regular expression"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "examples": [
        {
          "ref": "2007, Dick Grune, Ceriel J.H. Jacobs, Parsing Techniques: A Practical Guide, Springer Science & Business Media, →ISBN, page 152:",
          "text": "There is an interesting way to get the negation (complement) of a regular language L defined by a FS automaton, provided the automaton is ε-free.",
          "type": "quote"
        },
        {
          "ref": "2014, Brian MacWhinney, William O'Grady, The Handbook of Language Emergence, John Wiley & Sons, →ISBN, page 393:",
          "text": "A regular language is one that can be generated by a regular grammar or finite-state automaton, the lowest level of the Chomsky hierarchy. It is well known that these grammars are inadequate to represent natural language syntax.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A formal language that can be expressed using a regular expression or finite-state machine."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "formal language",
          "formal language"
        ],
        [
          "regular expression",
          "regular expression"
        ],
        [
          "finite-state machine",
          "finite-state machine"
        ]
      ],
      "raw_glosses": [
        "(computer science) A formal language that can be expressed using a regular expression or finite-state machine."
      ],
      "synonyms": [
        {
          "word": "rational language"
        }
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "regular language"
}