termsarea.html
来自「数据结构词典（英文）」· HTML 代码 · 共 571 行 · 第 1/5 页
HTML
571 行
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<!-- *created "Wed Nov 18 08:51:04 1998" *by "Paul E. Black" -->
<!-- *modified "Wed Dec 29 12:24:08 1999" *by "Paul E. Black" -->
<TITLE>Terms and Definitions Index by Area</TITLE>
<META name="description"
content="Index by area to definitions of algorithms, data
structures, and CS problems">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<CENTER> <H1>Index by Area</H1> </CENTER>
<CENTER> <H3>of</H3> </CENTER>
<CENTER> <H1><A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A></H1> </CENTER>
<CENTER> <H3>compiled originally for the</H3> </CENTER>
<CENTER> <H2>CRC Dictionary of Computer Science, Engineering and
Technology</H2> </CENTER>
<HR>
<P>
This is the web page of terms with definitions organized by area.
That is, whether the term deals with graphs, trees, sorting, etc.
We also list all
<A HREF="termsImpl.html" tppabs="http://hissa.nist.gov/dads/termsImpl.html">entries with links to implementations</A>
and
<A HREF="termsType.html" tppabs="http://hissa.nist.gov/dads/termsType.html">entries by type</A>, for instance, whether it
is an algorithm, a definition, a problem, or a data structure.
<P>
We need people to contribute.
If terms are missing or you can add or correct
definitions, please contact
<A HREF="javascript:if(confirm('http://hissa.nist.gov/~black/ \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/'" tppabs="http://hissa.nist.gov/~black/">me</A> by email
(<A HREF="mailto:paul.black@nist.gov">paul.black@nist.gov</A>) or by
other means.
<HR>
<!-- this is joined with indices and a conclusion to make a complete page -->
<!-- end of termsType.intro -->
<P>
Run on Thu Jan 20 16:53:22 2000
<h3>Areas</h3>
<ul>
<li><a href="#autom">Automata and State Machines</a>
<li><a href="#basic">Basic</a>
<li><a href="#combin">Combinatorics</a>
<li><a href="#crypt">Cryptography and Compression</a>
<li><a href="#geom">Computational Geometry</a>
<li><a href="#graph">Graphs</a>
<li><a href="#numeric">Numeric Computation</a>
<li><a href="#para">Parallel</a>
<li><a href="#search">Searching</a>
<li><a href="#sort">Sorting</a>
<li><a href="#theory">Theory</a>
<li><a href="#tree">Trees</a>
<li><a href="#verf">Verification and Formal Methods</a>
<li><a href="#noarea">Entries with No Area</a>
</ul>
<hr>
<h2><a name="autom">Automata and State Machines</a></h2>
<ul>
<li><a href="acceptingstt.html" tppabs="http://hissa.nist.gov/dads/HTML/acceptingstt.html">accepting state</a> [<strong>D</strong>]
<li><a href="alphabet.html" tppabs="http://hissa.nist.gov/dads/HTML/alphabet.html">alphabet</a> [<strong>D</strong>]
<li><a href="alternatngTr.html" tppabs="http://hissa.nist.gov/dads/HTML/alternatngTr.html">alternating Turing machine</a> [<strong>D</strong>]
<li><a href="automaton.html" tppabs="http://hissa.nist.gov/dads/HTML/automaton.html">automaton</a> [<strong>D</strong>]
<li><a href="automatonsim.html" tppabs="http://hissa.nist.gov/dads/HTML/automatonsim.html">automaton simulation</a> [<strong>D</strong>]
<li><a href="bottmptrtmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/bottmptrtmtn.html">bottom-up tree automaton</a> [<strong>D</strong>]
<li><a href="cellulartmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/cellulartmtn.html">cellular automaton</a> [<strong>D</strong>]
<li><a href="configuratin.html" tppabs="http://hissa.nist.gov/dads/HTML/configuratin.html">configuration</a> [<strong>D</strong>]
<li><a href="determfinaut.html" tppabs="http://hissa.nist.gov/dads/HTML/determfinaut.html">deterministic finite automaton</a> [<strong>D</strong>]
<li><a href="detrmfinstau.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfinstau.html">deterministic finite state automaton</a> [<strong>D</strong>]
<li><a href="detrmfinstmc.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfinstmc.html">deterministic finite state machine</a> [<strong>D</strong>]
<li><a href="detrmfintrau.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfintrau.html">deterministic finite tree automaton</a> [<strong>D</strong>]
<li><a href="determpushda.html" tppabs="http://hissa.nist.gov/dads/HTML/determpushda.html">deterministic pushdown automaton</a> [<strong>D</strong>]
<li><a href="detrmtreeaut.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmtreeaut.html">deterministic tree automaton</a> [<strong>D</strong>]
<li><a href="dfa.html" tppabs="http://hissa.nist.gov/dads/HTML/dfa.html">DFA</a> [<strong>D</strong>]
<li><a href="dfta.html" tppabs="http://hissa.nist.gov/dads/HTML/dfta.html">DFTA</a> [<strong>D</strong>]
<li><a href="dpda.html" tppabs="http://hissa.nist.gov/dads/HTML/dpda.html">DPDA</a> [<strong>D</strong>]
<li><a href="existentlstt.html" tppabs="http://hissa.nist.gov/dads/HTML/existentlstt.html">existential state</a> [<strong>D</strong>]
<li><a href="finiteautmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/finiteautmtn.html">finite automaton</a> [<strong>D</strong>]
<li><a href="finitestautm.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestautm.html">finite state automaton</a> [<strong>D</strong>]
<li><a href="finitestate.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestate.html">finite state machine</a> [<strong>D</strong>]
<li><a href="finitestmmin.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestmmin.html">finite state machine minimization</a> [<strong>P</strong>]
<li><a href="finsttransdu.html" tppabs="http://hissa.nist.gov/dads/HTML/finsttransdu.html">finite state transducer</a> [<strong>D</strong>]
<li><a href="id.html" tppabs="http://hissa.nist.gov/dads/HTML/id.html">ID</a> [<strong>D</strong>]
<li><a href="instantaneos.html" tppabs="http://hissa.nist.gov/dads/HTML/instantaneos.html">instantaneous description</a> [<strong>D</strong>]
<li><a href="kripkeStruct.html" tppabs="http://hissa.nist.gov/dads/HTML/kripkeStruct.html">Kripke structure</a> [<strong>D</strong>]
<li><a href="move.html" tppabs="http://hissa.nist.gov/dads/HTML/move.html">move</a> [<strong>D</strong>]
<li><a href="nextstate.html" tppabs="http://hissa.nist.gov/dads/HTML/nextstate.html">next state</a> [<strong>D</strong>]
<li><a href="nfta.html" tppabs="http://hissa.nist.gov/dads/HTML/nfta.html">NFTA</a> [<strong>D</strong>]
<li><a href="nondtrmnstfa.html" tppabs="http://hissa.nist.gov/dads/HTML/nondtrmnstfa.html">nondeterministic finite automaton</a> [<strong>D</strong>]
<li><a href="nondtrmnstcf.html" tppabs="http://hissa.nist.gov/dads/HTML/nondtrmnstcf.html">nondeterministic finite tree automaton</a> [<strong>D</strong>]
<li><a href="nondtrmnstct.html" tppabs="http://hissa.nist.gov/dads/HTML/nondtrmnstct.html">nondeterministic tree automaton</a> [<strong>D</strong>]
<li><a href="nondetrmtur.html" tppabs="http://hissa.nist.gov/dads/HTML/nondetrmtur.html">nondeterministic Turing machine</a> [<strong>D</strong>]
<li><a href="oracleset.html" tppabs="http://hissa.nist.gov/dads/HTML/oracleset.html">oracle set</a> [<strong>D</strong>]
<li><a href="oracletape.html" tppabs="http://hissa.nist.gov/dads/HTML/oracletape.html">oracle tape</a> [<strong>D</strong>]
<li><a href="oracleTur.html" tppabs="http://hissa.nist.gov/dads/HTML/oracleTur.html">oracle Turing machine</a> [<strong>D</strong>]
<li><a href="pda.html" tppabs="http://hissa.nist.gov/dads/HTML/pda.html">PDA</a> [<strong>D</strong>]
<li><a href="pram.html" tppabs="http://hissa.nist.gov/dads/HTML/pram.html">PRAM</a> [<strong>D</strong>]
<li><a href="probablturng.html" tppabs="http://hissa.nist.gov/dads/HTML/probablturng.html">probabilistic Turing machine</a> [<strong>D</strong>]
<li><a href="pushdownautm.html" tppabs="http://hissa.nist.gov/dads/HTML/pushdownautm.html">pushdown automaton</a> [<strong>D</strong>]
<li><a href="startstate.html" tppabs="http://hissa.nist.gov/dads/HTML/startstate.html">start state</a> [<strong>D</strong>]
<li><a href="state.html" tppabs="http://hissa.nist.gov/dads/HTML/state.html">state</a> [<strong>D</strong>]
<li><a href="suffixautmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/suffixautmtn.html">suffix automaton</a> [<strong>D</strong>]
<li><a href="topdwntrtmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/topdwntrtmtn.html">top-down tree automaton</a> [<strong>D</strong>]
<li><a href="transducer.html" tppabs="http://hissa.nist.gov/dads/HTML/transducer.html">transducer</a> [<strong>D</strong>]
<li><a href="transitionfn.html" tppabs="http://hissa.nist.gov/dads/HTML/transitionfn.html">transition function</a> [<strong>D</strong>]
<li><a href="treeautomata.html" tppabs="http://hissa.nist.gov/dads/HTML/treeautomata.html">tree automaton</a> [<strong>D</strong>]
<li><a href="turingmachin.html" tppabs="http://hissa.nist.gov/dads/HTML/turingmachin.html">Turing machine</a> [<strong>D</strong>]
<li><a href="unionautoma.html" tppabs="http://hissa.nist.gov/dads/HTML/unionautoma.html">union of automata</a> [<strong>A</strong>]
<li><a href="universalstt.html" tppabs="http://hissa.nist.gov/dads/HTML/universalstt.html">universal state</a> [<strong>D</strong>]
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?