Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03270460n
Noun Concept
Categories: Formal languages, Logic in computer science, Theoretical computer science stubs, Automata (computation)
EN
star-free language  Star-free regular language
EN
A regular language is said to be star-free if it can be described by a regular expression constructed from the letters of the alphabet, the empty set symbol, all boolean operators – including complementation – and concatenation but no Kleene star. Wikipedia
Definitions
Relations
Sources
EN
A regular language is said to be star-free if it can be described by a regular expression constructed from the letters of the alphabet, the empty set symbol, all boolean operators – including complementation – and concatenation but no Kleene star. Wikipedia
IS A
regular language
NAMED AFTER
Kleene star
Wikipedia
EN
star-free language
Wikidata
EN
Star-free language
Wikipedia Redirections
EN
Star-free regular language

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