0 votes 0 votes Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) . Theory of Computation finite-automata regular-language regular-expression strings + – upasesharanesh asked Apr 6, 2023 recategorized Apr 6, 2023 by makhdoom ghaya upasesharanesh 332 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes regular Expression = (0+1)*000(0+1)* L = {w000w| w belongs to {0,1}*} DextroLaev answered Apr 7, 2023 DextroLaev comment Share Follow See all 0 reply Please log in or register to add a comment.