Select all strings that the DFA below accepts.多项选择题

题目图片
A

bbbbaaab

B

bbbabab

C

aaabb

D

ε

E

abab

F

bababa

登录即可查看完整答案

我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。

类似问题

Given states as Q  and the alphabet of symbols as ∑, a  transition function δ for a DFA is a mapping function given by which of the following?  

A DFA cannot have more than one accepting states.

A DFA accepts a Language for some automaton.

In a DFA all states have the same number of transition

更多留学生实用工具

加入我们，立即解锁 海量真题 与 独家解析，让复习快人一步！