detrmfintrau.html

来自「数据结构词典（英文）」· HTML 代码 · 共 48 行

HTML
48 行
字号 
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>deterministic finite tree automaton</TITLE>
<META name="description"
  content="Definition of deterministic finite tree automaton,
	possibly with links to more information and implementations.">
<META name="keywords" content="deterministic finite tree automaton">
</HEAD>
<BODY BGCOLOR="#FFFFFF">

<H1>deterministic finite tree automaton</H1>
<P>
(definition)

<P>
<strong>Definition:</strong>
A <a href="determfinaut.html" tppabs="http://hissa.nist.gov/dads/HTML/determfinaut.html"><em>deterministic finite automaton</em></a> that accepts <a href="finitarytree.html" tppabs="http://hissa.nist.gov/dads/HTML/finitarytree.html"><em>finitary trees</em></a> rather than just <a href="string.html" tppabs="http://hissa.nist.gov/dads/HTML/string.html"><em>strings</em></a>.  The tree <a href="node.html" tppabs="http://hissa.nist.gov/dads/HTML/node.html"><em>nodes</em></a> are marked with the letters of the <a href="alphabet.html" tppabs="http://hissa.nist.gov/dads/HTML/alphabet.html"><em>alphabet</em></a> of the automaton, and the transition function encodes the <a href="nextstate.html" tppabs="http://hissa.nist.gov/dads/HTML/nextstate.html"><em>next states</em></a> for each branch of the tree.  The acceptance condition is modified accordingly.
<P><strong>See also</strong>
<a href="nondtrmnstcf.html" tppabs="http://hissa.nist.gov/dads/HTML/nondtrmnstcf.html"><em>nondeterministic finite tree automaton</em></a>, <a href="detrmtreeaut.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmtreeaut.html"><em>deterministic tree automaton</em></a>.
<P>Author: <a href="terms.html#authorSKS" tppabs="http://hissa.nist.gov/dads/terms.html#authorSKS">SKS</a>
<H2>More information</H2>
<A HREF="javascript:if(confirm('http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.grappa.univ-lille3.fr/tata/  \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://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.grappa.univ-lille3.fr/tata/'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.grappa.univ-lille3.fr/tata/">Tree Automata Techniques and Applications</A> page.

<hr>

Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.

<hr>

If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html  \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/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
&nbsp;(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).

<p>
Entry modified Sat Sep  4 16:07:41 1999.<BR>
HTML page formatted Wed Dec 22 09:35:07 1999.

<P>
This page's URL is
<A href="detrmfintrau.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfintrau.html">http://hissa.nist.gov/dads/HTML/detrmfintrau.html</A>

</BODY>
</HTML>

detrmfintrau.html - 源码说明

本页面展示了「数据结构词典（英文）」中的 detrmfintrau.html 源码文件，采用 HTML 编程语言编写，共 48 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与数据结构相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?