Einleitungssatz
The theory of finite-state automata is rich, and finite-state automata techniques are used in a wide range of domains, including switching theory, pattern matching, pattern recognition, speech processing, handwriting recognition, optical character recognition, encryption algorithm, data compression, indexing, and operating system analysis (e.g., Petri-net). Lesen Sie die erste Seite
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
|
||||||||||||||||||||
|
||||||||||||||||||||
|
||||||||||||||||||||
In diesem Buch
(Mehr dazu)
Wortanzeiger
(Mehr dazu)
Die 100 am häufigsten verwendeten Wörter in diesem Buch.
algorithm
analysis
application
automata
automaton
between
case
clause
composition
construction
contains
context
corresponds
de
defined
definition
deterministic
dictionary
different
entries
example
expressions
figure
final
finite
first
following
form
fsa
function
general
given
grammar
information
input
instance
john
labels
language
left
let
lexical
linguistics
lower
may
model
morphological
natural
new
noun
number
op
order
output
parsing
path
phrases
possible
problem
rational
regular
relation
replacement
representation
represented
represents
result
right
rules
second
section
sentence
sequence
sequential
set
should
simple
since
state
string
structure
symbol
syntactic
system
tagger
tags
take
text
therefore
thus
time
transducer
transduction
transition
two
upper
use
used
verb
words
|
