A maxmin problem on finite automata (Q1116710): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Jean-Marc Champarnaud / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jean-Eric Pin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Latest revision as of 14:27, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A maxmin problem on finite automata |
scientific article |
Statements
A maxmin problem on finite automata (English)
0 references
1989
0 references
We solve the following problem proposed by Straubing. Given a two-letter alphabet A, what is the maximal number of states f(n) of the minimal automaton of a subset of \(A^ n\), the set of all words of length n. We give an explicit formula to compute f(n) and we show that \(1=\liminf_{n\to \infty}nf(n)/2^ n\leq \limsup_{n\to \infty}nf(n)/2^ n=2.\)
0 references
maximal number of states of minimal automaton
0 references
two-letter alphabet
0 references
