Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q752532> ?p ?o }
Showing triples 1 to 71 of
71
with 100 triples per page.
- Q752532 subject Q7142640.
- Q752532 abstract "Template:ForIn theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be expressed using a regular expression, in the strict sense of the latter notion used in theoretical computer science (as opposed to many regular expressions engines provided by modern programming languages, which are augmented with features that allow recognition of languages that cannot be expressed by a classic regular expression).Alternatively, a regular language can be defined as a language recognized by a finite automaton. The equivalence of regular expressions and finite automata is known as Kleene's theorem. In the Chomsky hierarchy, regular languages are defined to be the languages that are generated by Type-3 grammars (regular grammars).Regular languages are very useful in input parsing and programming language design.".
- Q752532 wikiPageExternalLink RM704.pdf.
- Q752532 wikiPageExternalLink FlSe02.ps.gz.
- Q752532 wikiPageWikiLink Q1003025.
- Q752532 wikiPageWikiLink Q1155722.
- Q752532 wikiPageWikiLink Q1165112.
- Q752532 wikiPageWikiLink Q1192782.
- Q752532 wikiPageWikiLink Q12321.
- Q752532 wikiPageWikiLink Q126002.
- Q752532 wikiPageWikiLink Q1268618.
- Q752532 wikiPageWikiLink Q1333055.
- Q752532 wikiPageWikiLink Q1548746.
- Q752532 wikiPageWikiLink Q163310.
- Q752532 wikiPageWikiLink Q176452.
- Q752532 wikiPageWikiLink Q185359.
- Q752532 wikiPageWikiLink Q185612.
- Q752532 wikiPageWikiLink Q185837.
- Q752532 wikiPageWikiLink Q190913.
- Q752532 wikiPageWikiLink Q192161.
- Q752532 wikiPageWikiLink Q194152.
- Q752532 wikiPageWikiLink Q205084.
- Q752532 wikiPageWikiLink Q208237.
- Q752532 wikiPageWikiLink Q211790.
- Q752532 wikiPageWikiLink Q215206.
- Q752532 wikiPageWikiLink Q2166395.
- Q752532 wikiPageWikiLink Q2292874.
- Q752532 wikiPageWikiLink Q242767.
- Q752532 wikiPageWikiLink Q269878.
- Q752532 wikiPageWikiLink Q270513.
- Q752532 wikiPageWikiLink Q2872598.
- Q752532 wikiPageWikiLink Q2878974.
- Q752532 wikiPageWikiLink Q287954.
- Q752532 wikiPageWikiLink Q291256.
- Q752532 wikiPageWikiLink Q3065587.
- Q752532 wikiPageWikiLink Q3217203.
- Q752532 wikiPageWikiLink Q3262192.
- Q752532 wikiPageWikiLink Q3300791.
- Q752532 wikiPageWikiLink Q3321297.
- Q752532 wikiPageWikiLink Q335148.
- Q752532 wikiPageWikiLink Q41237.
- Q752532 wikiPageWikiLink Q422187.
- Q752532 wikiPageWikiLink Q4720939.
- Q752532 wikiPageWikiLink Q5204896.
- Q752532 wikiPageWikiLink Q535833.
- Q752532 wikiPageWikiLink Q5500266.
- Q752532 wikiPageWikiLink Q6058973.
- Q752532 wikiPageWikiLink Q617295.
- Q752532 wikiPageWikiLink Q645527.
- Q752532 wikiPageWikiLink Q670834.
- Q752532 wikiPageWikiLink Q6897882.
- Q752532 wikiPageWikiLink Q7142640.
- Q752532 wikiPageWikiLink Q729271.
- Q752532 wikiPageWikiLink Q7295782.
- Q752532 wikiPageWikiLink Q7302664.
- Q752532 wikiPageWikiLink Q7333652.
- Q752532 wikiPageWikiLink Q7486248.
- Q752532 wikiPageWikiLink Q7623989.
- Q752532 wikiPageWikiLink Q7886764.
- Q752532 wikiPageWikiLink Q837528.
- Q752532 wikiPageWikiLink Q849775.
- Q752532 wikiPageWikiLink Q860609.
- Q752532 wikiPageWikiLink Q860623.
- Q752532 wikiPageWikiLink Q861141.
- Q752532 wikiPageWikiLink Q905967.
- Q752532 wikiPageWikiLink Q908207.
- Q752532 wikiPageWikiLink Q912887.
- Q752532 wikiPageWikiLink Q9143.
- Q752532 wikiPageWikiLink Q995671.
- Q752532 comment "Template:ForIn theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be expressed using a regular expression, in the strict sense of the latter notion used in theoretical computer science (as opposed to many regular expressions engines provided by modern programming languages, which are augmented with features that allow recognition of languages that cannot be expressed by a classic regular expression).Alternatively, a regular language can be defined as a language recognized by a finite automaton. ".
- Q752532 label "Regular language".