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)

Related topics

Related topics

18 relations
AlgorithmAutomata theoryBoyer–Moore–Horspool algorithmDeterministic finite automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
HFST runtime format: A compacted transducer format allowing for fast lookup
Lexical transducers form part of most language-aware applications, which means that less time spent on lexical lookup will have… 
2006
2006
Blind adaptive equalizer for IIR channels with common zeros
This paper considers the problem of blind adaptive equalization of single-input multiple-output IIR channels without requiring… 
2004
2004
A New SLM OFDM System with Low Complexity for PAPR Reduction
In this paper, we introduce a new selected mapping (SLM) orthogonal frequency division multiplexing (OFDM) scheme with low… 
2002
2002
Soft-decision Reed-Solomon decoding on partial response channels
We compare the performance of list-type soft-decision Reed-Solomon (RS) decoding algorithms to that of classical hard-decision RS… 
2001
2001
Online Text Prediction with Recurrent Neural Networks
Arithmetic coding is one of the most outstanding techniques for lossless data compression. It attains its good performance with… 
2000
2000
Regional Least-Cost Error Repair
We describe an algorithm to deal with automatic error repair over unrestricted context-free languages. The method relies on a… 
Highly Cited
1994
Highly Cited
1994
User-separating demodulation for code-division multiple-access systems
A user-separating (US) demodulator for a multiple-access system with digital transmission is defined to be a demodulator that… 
Review
1994
Review
1994
Multiplication and division free adaptive arithmetic coding techniques for bi-level images
Two new approximate methods for coding the binary alphabet with negligible loss of compression efficiency are proposed. An… 
1983
1983
Low Complexity Decoders for Constant Envelope Digital Modulations
Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or… 
1962
1962
Sequential decoding for discrete input memoryless channels
A scheme is described which sequentially encodes the output of a discrete letter source into the input symbols of a discrete… 
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)