STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \textit{Grail}: A C++ library for automata and expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The state complexities of some basic operations on regular languages / rank | |||
Normal rank | |||
Latest revision as of 21:00, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES |
scientific article |
Statements
STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (English)
0 references
24 November 2008
0 references
finite-state automata
0 references
