This HTML5 document contains 12 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbnaryhttp://kaiko.getalp.org/dbnary#
skoshttp://www.w3.org/2004/02/skos/core#
ontolexhttp://www.w3.org/ns/lemon/ontolex#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbnary-enghttp://kaiko.getalp.org/dbnary/eng/

Statements

Subject Item
dbnary-eng:__ws_1_regular_language__Noun__1
rdf:type
ontolex:LexicalSense
skos:definition
_:vb8097921
dbnary:hypernym
dbnary-eng:formal_language
dbnary:senseNumber
1
dbnary:synonym
dbnary-eng:rational_language
skos:example
_:vb8097922 _:vb8097923
Subject Item
_:vb8097921
rdf:value
(computer science) A formal language that can be expressed using a regular expression or finite-state machine.
Subject Item
_:vb8097922
rdf:value
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.
dcterms:bibliographicCitation
2007, Dick Grune, Ceriel J.H. Jacobs, Parsing Techniques: A Practical Guide, Springer Science & Business Media, →ISBN, page 152:
Subject Item
_:vb8097923
rdf:value
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.
dcterms:bibliographicCitation
2014, Brian MacWhinney, William O'Grady, The Handbook of Language Emergence, John Wiley & Sons, →ISBN, page 393: