A maxmin problem on finite automata
From MaRDI portal
Publication:1116710
DOI10.1016/0166-218X(89)90037-1zbMath0666.68078MaRDI QIDQ1116710
Jean-Marc Champarnaud, Jean-Eric Pin
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states, VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states, More on deterministic and nondeterministic finite cover automata, On the average state and transition complexity of finite languages, More on Deterministic and Nondeterministic Finite Cover Automata, Separating the Classes of Recursively Enumerable Languages Based on Machine Size
Cites Work