An Implementation of Deterministic Tree Automata Minimization (Q3503900): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_13 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1544575850 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The minimalization of tree automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3323279 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three Partition Refinement Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Incremental construction of minimal tree automata / rank | |||
Normal rank |
Latest revision as of 10:37, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Implementation of Deterministic Tree Automata Minimization |
scientific article |
Statements
An Implementation of Deterministic Tree Automata Minimization (English)
0 references
10 June 2008
0 references
minimal deterministic tree automata
0 references
minimization of automata
0 references
0 references