A maxmin problem on finite automata (Q1116710)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A maxmin problem on finite automata |
scientific article; zbMATH DE number 4090832
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A maxmin problem on finite automata |
scientific article; zbMATH DE number 4090832 |
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
0 references
0.8851258
0 references
0.88309824
0 references
0.87754387
0 references
