H
halting problem halt state of a Turing machine Hamiltonian path problem
hierarchy of formal languages homomorphic image homomorphism
I incompleteness theorem inherent ambiguity initial state
input alphabet
input file
instantaneous description of a pushdown automaton of a Turing machine internal
states of an automaton intractable problems J
JFLAP
L
lambda-productions
languages
accepted by a dfa accepted by a dpda accepted by an lba accepted by an nfa
accepted by an npda accepted by a Turing machine, associated with a regular
expression
generated by a grammar generated by a Markov algorithm, generated by Post
system lba
left-linear grammars leftmost derivation limitations of finite-state transducers
linear bounded automata LL grammars
loop
L-systems
M
µ-recursive functions Markov algorithm matrix grammar
Mealy machines
membership algorithm for context-free languages for context-sensitive
languages for regular languages minimal dfa
minimalization operator monus
Moore machines
MPC solution
M-translation