Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01923400n
Noun Concept
Categories: Finite automata, Formal languages
EN
regular language  Finite language  Kleene's theorem  rational language  regular languages
EN
In theoretical computer science and formal language theory, a regular language is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science. Wikipedia
Definitions
Relations
Sources
EN
In theoretical computer science and formal language theory, a regular language is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science. Wikipedia
A formal language recognizable by a finite state automaton Wikipedia Disambiguation
Formal language that can be expressed using a regular expression Wikidata
A formal language that can be expressed using a regular expression or finite-state machine. Wiktionary
IS A
context-free language
HAS KIND
star-free language
Myhill–Nerode theorem
DIFFERENT FROM
schematic language
Wikipedia
EN
regular language
Wikidata
EN
regular language
Wiktionary
EN
regular language
Wikipedia Redirections
EN
Finite language, Kleene's theorem, rational language, Regular Language, regular languages

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License