Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,291 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Algorithm
Automata theory
Boyer–Moore–Horspool algorithm
Deterministic finite automaton
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Phase modulation for discrete-time wiener phase noise channels with oversampling at high SNR
H. Ghozlan
,
G. Kramer
IEEE International Symposium on Information…
2014
Corpus ID: 10041416
A discrete-time Wiener phase noise channel model is introduced in which multiple samples are available at the output for every…
Expand
2012
2012
Turing Machines for Dummies - Why Representations Do Matter
P. E. Boas
Conference on Current Trends in Theory and…
2012
Corpus ID: 15324043
Various methods exists in the litearture for denoting the configuration of a Turing Machine. A key difference is whether the head…
Expand
Highly Cited
2005
Highly Cited
2005
A new SLM OFDM scheme with low complexity for PAPR reduction
Dae-Woon Lim
,
Jong-Seon No
,
Chi-Woo Lim
,
Habong Chung
IEEE Signal Processing Letters
2005
Corpus ID: 52854810
The authors introduce a new selected mapping (SLM) orthogonal frequency division multiplexing (OFDM) scheme with low…
Expand
2003
2003
The Equivalence Problem for t-Turn DPDA Is Co-NP
Géraud Sénizergues
International Colloquium on Automata, Languages…
2003
Corpus ID: 10940110
We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing…
Expand
Highly Cited
1994
Highly Cited
1994
User-separating demodulation for code-division multiple-access systems
M. Rupf
,
Felix Tarköy
,
J. Massey
IEEE J. Sel. Areas Commun.
1994
Corpus ID: 36811147
A user-separating (US) demodulator for a multiple-access system with digital transmission is defined to be a demodulator that…
Expand
1993
1993
Understanding mathematical expressions in a printed document
Hsi-Jian Lee
,
Min-Chou Lee
Proceedings of 2nd International Conference on…
1993
Corpus ID: 46528633
A system for understanding mathematical expressions is presented. After separating all symbols in an input mathematical…
Expand
1992
1992
Infoods: Food Composition Data Interchange Handbook
J. Klensin
1992
Corpus ID: 60166207
1983
1983
Low Complexity Decoders for Constant Envelope Digital Modulations
S. Simmons
,
P. Wittke
IEEE Transactions on Communications
1983
Corpus ID: 62628258
Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or…
Expand
Highly Cited
1980
Highly Cited
1980
Recognition of handprinted Tamil characters
P. Chinnuswamy
,
S. Krishnamoorthy
Pattern Recognition
1980
Corpus ID: 36594464
1962
1962
Sequential decoding for discrete input memoryless channels
B. Reiffen
IRE Transactions on Information Theory
1962
Corpus ID: 20353637
A scheme is described which sequentially encodes the output of a discrete letter source into the input symbols of a discrete…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE