Skip to search formSkip to main contentSkip to account menu

Alphabet (formal languages)

Known as: Alphabet (computer science), Alphabet (disambiguation), Input symbol 
In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the alphabet of a string… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A discrete-time Wiener phase noise channel model is introduced in which multiple samples are available at the output for every… 
2012
2012
Various methods exists in the litearture for denoting the configuration of a Turing Machine. A key difference is whether the head… 
Highly Cited
2005
Highly Cited
2005
The authors introduce a new selected mapping (SLM) orthogonal frequency division multiplexing (OFDM) scheme with low… 
2003
2003
We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing… 
Highly Cited
1994
Highly Cited
1994
A user-separating (US) demodulator for a multiple-access system with digital transmission is defined to be a demodulator that… 
1993
1993
A system for understanding mathematical expressions is presented. After separating all symbols in an input mathematical… 
1983
1983
Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or… 
1962
1962
A scheme is described which sequentially encodes the output of a discrete letter source into the input symbols of a discrete…