Syntactic monoid

Known as: Myhill congruence, Syntactic equivalence, Myhill

In mathematics and computer science, the syntactic monoid M(L) of a formal language L is the smallest monoid that recognizes the language L.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

While dependency parsers reach very high overall accuracy, some dependency relations are much harder than others. In particular…

2013

Error words that appear in Korean texts can be largely categorized into non-word spelling errors and context-sensitive spelling…

2008

We describe Boeing's NLP system, BLUE, comprising a pipeline of a parser, a logical form (LF) generator, an initial logic…

2006

This article discusses the phenomenon of pied-piping in restrictive relative clauses in the Germanic languages Dutch, German, and…

2004

The aim of the present contribution is to present s veral hypotheses that may help to characterize and identify contrast as such…

2003

Possessives are “complex” DPs: they involve two distinct no mi al expressions as components. 1 In this paper I address the issue…

2000

Syntactic Priming in German Sentence Production Christoph Scheepers (chsc@coli.uni-sb.de) Department of Computational Linguistics…

1992

We show: There is no tree language whose syntactic semigroup lies in Kr, or in LI unless it is in K. Instead, reverse (resp…

1983

For a languageL the syntactic monoid SynL is trivial if and only if indeedL itself is trivial, that isL = Ø orL=X*. As a surprise…

1979