non-regular languages
Description: Formal languages that cannot be recognized by any finite automaton, studied in automata theory and the theory of computation.
Primary topic: semigroups and automata theory (77%)
Related topic: semigroups and automata theory (77%)
OpenAlex ID: keywords/non-regular-languages
