EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA (Q3526533): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Enumeration and generation with a string automata representation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3396587 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact enumeration of acyclic deterministic automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4855565 / rank | |||
Normal rank | |||
Revision as of 17:43, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA |
scientific article |
Statements
EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA (English)
0 references
25 September 2008
0 references
minimal automata
0 references
finite languages
0 references
