32:I[196793,["/_next/static/chunks/075vy1fh16gh5.js?dpl=nogit-1790172947","/_next/static/chunks/060-i_62-vse1.js?dpl=nogit-1790172947","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790172947","/_next/static/chunks/2yhf9vq09dqoa.js?dpl=nogit-1790172947","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790172947","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790172947","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790172947","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790172947","/_next/static/chunks/316m85d5s15pp.js?dpl=nogit-1790172947","/_next/static/chunks/2_itvjgqsumf8.js?dpl=nogit-1790172947","/_next/static/chunks/2wptr05dvvad-.js?dpl=nogit-1790172947","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790172947","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790172947","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790172947","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790172947","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790172947","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790172947","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790172947","/_next/static/chunks/32qmkt01ta8b2.js?dpl=nogit-1790172947","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790172947","/_next/static/chunks/1bbv7o2-m-0ni.js?dpl=nogit-1790172947","/_next/static/chunks/097slu7xaeast.js?dpl=nogit-1790172947","/_next/static/chunks/0shhrr8zrsvma.js?dpl=nogit-1790172947","/_next/static/chunks/0j1q2_fxvgx28.js?dpl=nogit-1790172947","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790172947","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790172947","/_next/static/chunks/0mgw5qzpc_1eu.js?dpl=nogit-1790172947","/_next/static/chunks/09_ag440ieydu.js?dpl=nogit-1790172947","/_next/static/chunks/0gvj8_2lj8s8m.js?dpl=nogit-1790172947","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790172947","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790172947","/_next/static/chunks/2ydqdr10ndcei.js?dpl=nogit-1790172947","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790172947","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790172947","/_next/static/chunks/32i_8fssnjnil.js?dpl=nogit-1790172947","/_next/static/chunks/2eoustw-nfu98.js?dpl=nogit-1790172947","/_next/static/chunks/1oz24qjw4uq89.js?dpl=nogit-1790172947","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790172947","/_next/static/chunks/0itrgb6vzmww0.js?dpl=nogit-1790172947","/_next/static/chunks/00ol_16j3a2oa.js?dpl=nogit-1790172947","/_next/static/chunks/0odk_0my0_b5-.js?dpl=nogit-1790172947","/_next/static/chunks/0dbk553rgd90s.js?dpl=nogit-1790172947","/_next/static/chunks/0aq3eylxphp57.js?dpl=nogit-1790172947","/_next/static/chunks/2srfni4gkx9g6.js?dpl=nogit-1790172947","/_next/static/chunks/3k8iy5tn80za8.js?dpl=nogit-1790172947","/_next/static/chunks/2hccrcvndngge.js?dpl=nogit-1790172947","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790172947","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790172947","/_next/static/chunks/1bt82o91jhwht.js?dpl=nogit-1790172947","/_next/static/chunks/1nnw6yom6-qhh.js?dpl=nogit-1790172947","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790172947","/_next/static/chunks/2_vtmw66zj1j7.js?dpl=nogit-1790172947","/_next/static/chunks/0ep4vrgb00zlb.js?dpl=nogit-1790172947","/_next/static/chunks/2s1hkstzlmj2o.js?dpl=nogit-1790172947","/_next/static/chunks/2wp4esku6l29e.js?dpl=nogit-1790172947","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790172947","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790172947","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790172947","/_next/static/chunks/1__39-dgg7p8-.js?dpl=nogit-1790172947","/_next/static/chunks/2gb4dscyul4eg.js?dpl=nogit-1790172947","/_next/static/chunks/1y5xmyjgu8grb.js?dpl=nogit-1790172947","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790172947","/_next/static/chunks/0kpd0j3i_7yor.js?dpl=nogit-1790172947","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790172947","/_next/static/chunks/0sf7rskx57j6y.js?dpl=nogit-1790172947","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790172947","/_next/static/chunks/3ghbpnibq2fva.js?dpl=nogit-1790172947","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790172947"],"Gingerbread"] 34:I[647935,["/_next/static/chunks/075vy1fh16gh5.js?dpl=nogit-1790172947","/_next/static/chunks/060-i_62-vse1.js?dpl=nogit-1790172947","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790172947","/_next/static/chunks/2yhf9vq09dqoa.js?dpl=nogit-1790172947","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790172947","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790172947","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790172947","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790172947","/_next/static/chunks/316m85d5s15pp.js?dpl=nogit-1790172947","/_next/static/chunks/2_itvjgqsumf8.js?dpl=nogit-1790172947","/_next/static/chunks/2wptr05dvvad-.js?dpl=nogit-1790172947","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790172947","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790172947","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790172947","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790172947","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790172947","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790172947","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790172947","/_next/static/chunks/32qmkt01ta8b2.js?dpl=nogit-1790172947","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790172947","/_next/static/chunks/1bbv7o2-m-0ni.js?dpl=nogit-1790172947","/_next/static/chunks/097slu7xaeast.js?dpl=nogit-1790172947","/_next/static/chunks/0shhrr8zrsvma.js?dpl=nogit-1790172947","/_next/static/chunks/0j1q2_fxvgx28.js?dpl=nogit-1790172947","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790172947","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790172947","/_next/static/chunks/0mgw5qzpc_1eu.js?dpl=nogit-1790172947","/_next/static/chunks/09_ag440ieydu.js?dpl=nogit-1790172947","/_next/static/chunks/0gvj8_2lj8s8m.js?dpl=nogit-1790172947","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790172947","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790172947","/_next/static/chunks/2ydqdr10ndcei.js?dpl=nogit-1790172947","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790172947","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790172947","/_next/static/chunks/32i_8fssnjnil.js?dpl=nogit-1790172947","/_next/static/chunks/2eoustw-nfu98.js?dpl=nogit-1790172947","/_next/static/chunks/1oz24qjw4uq89.js?dpl=nogit-1790172947","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790172947","/_next/static/chunks/0itrgb6vzmww0.js?dpl=nogit-1790172947","/_next/static/chunks/00ol_16j3a2oa.js?dpl=nogit-1790172947","/_next/static/chunks/0odk_0my0_b5-.js?dpl=nogit-1790172947","/_next/static/chunks/0dbk553rgd90s.js?dpl=nogit-1790172947","/_next/static/chunks/0aq3eylxphp57.js?dpl=nogit-1790172947","/_next/static/chunks/2srfni4gkx9g6.js?dpl=nogit-1790172947","/_next/static/chunks/3k8iy5tn80za8.js?dpl=nogit-1790172947","/_next/static/chunks/2hccrcvndngge.js?dpl=nogit-1790172947","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790172947","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790172947","/_next/static/chunks/1bt82o91jhwht.js?dpl=nogit-1790172947","/_next/static/chunks/1nnw6yom6-qhh.js?dpl=nogit-1790172947","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790172947","/_next/static/chunks/2_vtmw66zj1j7.js?dpl=nogit-1790172947","/_next/static/chunks/0ep4vrgb00zlb.js?dpl=nogit-1790172947","/_next/static/chunks/2s1hkstzlmj2o.js?dpl=nogit-1790172947","/_next/static/chunks/2wp4esku6l29e.js?dpl=nogit-1790172947","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790172947","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790172947","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790172947","/_next/static/chunks/1__39-dgg7p8-.js?dpl=nogit-1790172947","/_next/static/chunks/2gb4dscyul4eg.js?dpl=nogit-1790172947","/_next/static/chunks/1y5xmyjgu8grb.js?dpl=nogit-1790172947","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790172947","/_next/static/chunks/0kpd0j3i_7yor.js?dpl=nogit-1790172947","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790172947","/_next/static/chunks/0sf7rskx57j6y.js?dpl=nogit-1790172947","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790172947","/_next/static/chunks/3ghbpnibq2fva.js?dpl=nogit-1790172947","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790172947"],"RecordResourceResume"] 35:I[830476,["/_next/static/chunks/075vy1fh16gh5.js?dpl=nogit-1790172947","/_next/static/chunks/060-i_62-vse1.js?dpl=nogit-1790172947","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790172947","/_next/static/chunks/2yhf9vq09dqoa.js?dpl=nogit-1790172947","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790172947","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790172947","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790172947","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790172947","/_next/static/chunks/316m85d5s15pp.js?dpl=nogit-1790172947","/_next/static/chunks/2_itvjgqsumf8.js?dpl=nogit-1790172947","/_next/static/chunks/2wptr05dvvad-.js?dpl=nogit-1790172947","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790172947","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790172947","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790172947","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790172947","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790172947","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790172947","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790172947","/_next/static/chunks/32qmkt01ta8b2.js?dpl=nogit-1790172947","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790172947","/_next/static/chunks/1bbv7o2-m-0ni.js?dpl=nogit-1790172947","/_next/static/chunks/097slu7xaeast.js?dpl=nogit-1790172947","/_next/static/chunks/0shhrr8zrsvma.js?dpl=nogit-1790172947","/_next/static/chunks/0j1q2_fxvgx28.js?dpl=nogit-1790172947","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790172947","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790172947","/_next/static/chunks/0mgw5qzpc_1eu.js?dpl=nogit-1790172947","/_next/static/chunks/09_ag440ieydu.js?dpl=nogit-1790172947","/_next/static/chunks/0gvj8_2lj8s8m.js?dpl=nogit-1790172947","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790172947","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790172947","/_next/static/chunks/2ydqdr10ndcei.js?dpl=nogit-1790172947","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790172947","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790172947","/_next/static/chunks/32i_8fssnjnil.js?dpl=nogit-1790172947","/_next/static/chunks/2eoustw-nfu98.js?dpl=nogit-1790172947","/_next/static/chunks/1oz24qjw4uq89.js?dpl=nogit-1790172947","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790172947","/_next/static/chunks/0itrgb6vzmww0.js?dpl=nogit-1790172947","/_next/static/chunks/00ol_16j3a2oa.js?dpl=nogit-1790172947","/_next/static/chunks/0odk_0my0_b5-.js?dpl=nogit-1790172947","/_next/static/chunks/0dbk553rgd90s.js?dpl=nogit-1790172947","/_next/static/chunks/0aq3eylxphp57.js?dpl=nogit-1790172947","/_next/static/chunks/2srfni4gkx9g6.js?dpl=nogit-1790172947","/_next/static/chunks/3k8iy5tn80za8.js?dpl=nogit-1790172947","/_next/static/chunks/2hccrcvndngge.js?dpl=nogit-1790172947","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790172947","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790172947","/_next/static/chunks/1bt82o91jhwht.js?dpl=nogit-1790172947","/_next/static/chunks/1nnw6yom6-qhh.js?dpl=nogit-1790172947","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790172947","/_next/static/chunks/2_vtmw66zj1j7.js?dpl=nogit-1790172947","/_next/static/chunks/0ep4vrgb00zlb.js?dpl=nogit-1790172947","/_next/static/chunks/2s1hkstzlmj2o.js?dpl=nogit-1790172947","/_next/static/chunks/2wp4esku6l29e.js?dpl=nogit-1790172947","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790172947","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790172947","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790172947","/_next/static/chunks/1__39-dgg7p8-.js?dpl=nogit-1790172947","/_next/static/chunks/2gb4dscyul4eg.js?dpl=nogit-1790172947","/_next/static/chunks/1y5xmyjgu8grb.js?dpl=nogit-1790172947","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790172947","/_next/static/chunks/0kpd0j3i_7yor.js?dpl=nogit-1790172947","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790172947","/_next/static/chunks/0sf7rskx57j6y.js?dpl=nogit-1790172947","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790172947","/_next/static/chunks/3ghbpnibq2fva.js?dpl=nogit-1790172947","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790172947"],"FlashcardAccessBranch"] 36:I[315438,["/_next/static/chunks/075vy1fh16gh5.js?dpl=nogit-1790172947","/_next/static/chunks/060-i_62-vse1.js?dpl=nogit-1790172947","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790172947","/_next/static/chunks/2yhf9vq09dqoa.js?dpl=nogit-1790172947","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790172947","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790172947","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790172947","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790172947","/_next/static/chunks/316m85d5s15pp.js?dpl=nogit-1790172947","/_next/static/chunks/2_itvjgqsumf8.js?dpl=nogit-1790172947","/_next/static/chunks/2wptr05dvvad-.js?dpl=nogit-1790172947","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790172947","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790172947","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790172947","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790172947","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790172947","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790172947","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790172947","/_next/static/chunks/32qmkt01ta8b2.js?dpl=nogit-1790172947","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790172947","/_next/static/chunks/1bbv7o2-m-0ni.js?dpl=nogit-1790172947","/_next/static/chunks/097slu7xaeast.js?dpl=nogit-1790172947","/_next/static/chunks/0shhrr8zrsvma.js?dpl=nogit-1790172947","/_next/static/chunks/0j1q2_fxvgx28.js?dpl=nogit-1790172947","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790172947","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790172947","/_next/static/chunks/0mgw5qzpc_1eu.js?dpl=nogit-1790172947","/_next/static/chunks/09_ag440ieydu.js?dpl=nogit-1790172947","/_next/static/chunks/0gvj8_2lj8s8m.js?dpl=nogit-1790172947","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790172947","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790172947","/_next/static/chunks/2ydqdr10ndcei.js?dpl=nogit-1790172947","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790172947","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790172947","/_next/static/chunks/32i_8fssnjnil.js?dpl=nogit-1790172947","/_next/static/chunks/2eoustw-nfu98.js?dpl=nogit-1790172947","/_next/static/chunks/1oz24qjw4uq89.js?dpl=nogit-1790172947","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790172947","/_next/static/chunks/0itrgb6vzmww0.js?dpl=nogit-1790172947","/_next/static/chunks/00ol_16j3a2oa.js?dpl=nogit-1790172947","/_next/static/chunks/0odk_0my0_b5-.js?dpl=nogit-1790172947","/_next/static/chunks/0dbk553rgd90s.js?dpl=nogit-1790172947","/_next/static/chunks/0aq3eylxphp57.js?dpl=nogit-1790172947","/_next/static/chunks/2srfni4gkx9g6.js?dpl=nogit-1790172947","/_next/static/chunks/3k8iy5tn80za8.js?dpl=nogit-1790172947","/_next/static/chunks/2hccrcvndngge.js?dpl=nogit-1790172947","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790172947","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790172947","/_next/static/chunks/1bt82o91jhwht.js?dpl=nogit-1790172947","/_next/static/chunks/1nnw6yom6-qhh.js?dpl=nogit-1790172947","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790172947","/_next/static/chunks/2_vtmw66zj1j7.js?dpl=nogit-1790172947","/_next/static/chunks/0ep4vrgb00zlb.js?dpl=nogit-1790172947","/_next/static/chunks/2s1hkstzlmj2o.js?dpl=nogit-1790172947","/_next/static/chunks/2wp4esku6l29e.js?dpl=nogit-1790172947","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790172947","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790172947","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790172947","/_next/static/chunks/1__39-dgg7p8-.js?dpl=nogit-1790172947","/_next/static/chunks/2gb4dscyul4eg.js?dpl=nogit-1790172947","/_next/static/chunks/1y5xmyjgu8grb.js?dpl=nogit-1790172947","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790172947","/_next/static/chunks/0kpd0j3i_7yor.js?dpl=nogit-1790172947","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790172947","/_next/static/chunks/0sf7rskx57j6y.js?dpl=nogit-1790172947","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790172947","/_next/static/chunks/3ghbpnibq2fva.js?dpl=nogit-1790172947","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790172947"],"TopicFlashcardRunner"] 23:[["$","$L32",null,{"feature":"flashcards"}],"$L33",["$","$L34",null,{"href":"/a-level/computer-science/aqa/regular-languages/flashcards","label":"Regular languages","subjectCode":"a_level_computer_science__aqa","surface":"flashcards"}],["$","$L35",null,{"runner":["$","div",null,{"className":"min-h-0 flex-1 overflow-hidden bg-background","children":["$","$L36",null,{"decks":[{"id":"ecaedfd2-02ca-42e1-b834-fa5e68e9e5be","title":"Regular languages Flashcards","topicId":"4e5224a2-9c64-567f-aaff-158ede25e62c","topicSlug":"regular-languages","cards":[{"id":"62bebee6-720e-429c-89be-8e25b1bfbf2f","cardType":"basic","points":1,"front":"What is an alphabet in the context of regular languages?","back":"A finite set of symbols that may appear in a string.","mcqOptions":[{"text":"A finite set of symbols that may appear in a string.","correct":true,"explanation":"An alphabet supplies the permitted atomic symbols from which strings are formed. It must be a finite set, although the resulting language may contain infinitely many strings."},{"text":"An infinite set of symbols that may appear in a string.","correct":false,"explanation":"This confuses the alphabet with the potentially unbounded language formed from it. The alphabet itself is a finite set of symbols that may appear in strings."},{"text":"A finite sequence of symbols that may appear in a string.","correct":false,"explanation":"A sequence has an order and may contain repeated symbols, whereas an alphabet does not. An alphabet is a finite set of the permitted symbols."},{"text":"A finite set of strings that may appear in a language.","correct":false,"explanation":"Strings are constructed from an alphabet and may belong to a language; they are not its elements. An alphabet is a finite set of individual symbols."}]},{"id":"8cfce396-5450-4632-9a73-eece5a9aacff","cardType":"basic","points":1,"front":"In a state transition diagram, how is the initial state identified?","back":"By a start arrow pointing to the state.","mcqOptions":[{"text":"By a start arrow pointing to the state.","correct":true,"explanation":"A start arrow enters the initial state from outside the diagram, showing where processing begins before any input symbol has been read."},{"text":"By a double circle drawn around the state.","correct":false,"explanation":"A double circle identifies an accepting state, not necessarily the initial state. The initial state is identified by a start arrow pointing towards it."},{"text":"By a self-loop attached to the state.","correct":false,"explanation":"A self-loop represents a transition that returns to the same state after reading input. The initial state instead has a start arrow pointing to it."},{"text":"By an exit arrow pointing away from the state.","correct":false,"explanation":"An arrow leaving a state represents an ordinary transition to another state. Processing begins at the state with a start arrow pointing towards it."}]},{"id":"d249bcca-b728-497e-8c7b-80dfd26e6544","cardType":"basic","points":1,"front":"How are accepting states visually distinguished in a state transition diagram?","back":"They are represented by a double circle.","mcqOptions":[{"text":"They are represented by a double circle.","correct":true,"explanation":"The double boundary marks a state in which the machine accepts the input if processing finishes there. Ordinary non-accepting states have a single circle."},{"text":"They are represented by a single circle.","correct":false,"explanation":"A single circle is the normal representation for a state and does not show acceptance. Accepting states are specifically distinguished using a double circle."},{"text":"They are represented by a start arrow.","correct":false,"explanation":"A start arrow identifies the initial state, which may or may not also be accepting. Acceptance itself is indicated by drawing the state as a double circle."},{"text":"They are represented by a shaded circle.","correct":false,"explanation":"Shading is not the standard notation for acceptance in a state transition diagram. Accepting states are shown with two concentric circles instead."}]},{"id":"3f98c3fa-bc8e-48b7-8030-cab504757e1f","cardType":"basic","points":2,"front":"What is a Mealy machine?","back":"A finite state machine that produces output on every transition.","mcqOptions":[{"text":"A finite state machine that produces output on every transition.","correct":true,"explanation":"In a Mealy machine, outputs are associated with transitions. Each transition label specifies both the input that triggers it and the output produced."},{"text":"A finite state machine that produces output only in accepting states.","correct":false,"explanation":"Producing output only after reaching an accepting state confuses output machines with language acceptors. A Mealy machine associates an output with every transition."},{"text":"A finite state machine that chooses randomly between possible transitions.","correct":false,"explanation":"Having several possible transitions for one input describes nondeterminism, not a Mealy machine. A Mealy machine is defined by producing output on its transitions."},{"text":"A finite state machine that uses a stack on every transition.","correct":false,"explanation":"A stack is additional memory used by a pushdown automaton. A Mealy machine has only finite states and produces an output whenever a transition occurs."}]},{"id":"d326cb43-7f7c-4e22-b605-8aa7a97def8b","cardType":"basic","points":1,"front":"On a Mealy machine transition labelled 0/1, what does the 1 represent?","back":"The output symbol produced when the transition is taken.","mcqOptions":[{"text":"The output symbol produced when the transition is taken.","correct":true,"explanation":"Mealy transition labels conventionally use the form input/output. Therefore 0 triggers the transition, while 1 is emitted as its output."},{"text":"The input symbol read when the transition is taken.","correct":false,"explanation":"This reverses the two parts of the transition label. In 0/1, 0 is the input symbol and 1 is the output symbol."},{"text":"The destination state reached when the transition is taken.","correct":false,"explanation":"The destination is shown by the state to which the arrow points, not by the label after the slash. The 1 specifies the output produced."},{"text":"The current state number recorded when the transition is taken.","correct":false,"explanation":"State numbers appear inside or beside states rather than after the slash. In a Mealy label, the value after the slash is the output symbol."}]},{"id":"89c418ad-1856-470d-96bc-16340b3a724d","cardType":"cloze","points":null,"front":"In set notation, the symbol $\\text{[...]}$ means \"such that\" and $\\in$ means \"is a member of set\".","back":"In set notation, the symbol $\\boxed{\\mid}$ means \"such that\" and $\\in$ means \"is a member of set\".","mcqOptions":[{"text":"$$\\mid$","correct":true,"explanation":"The vertical bar separates an element description from its required condition in set-builder notation, so it is read as “such that”."},{"text":"$$\\in$","correct":false,"explanation":"The membership symbol states that an element belongs to a set. The vertical bar $\\mid$, rather than $\\in$, is used here to mean “such that”."},{"text":"$$\\subseteq$","correct":false,"explanation":"This symbol expresses that one set is a subset of another, so it does not introduce a condition. The vertical bar $\\mid$ means “such that”."},{"text":"$$\\cup$","correct":false,"explanation":"The union symbol combines the elements of two sets rather than introducing a set-builder condition. The required “such that” symbol is $\\mid$."}]},{"id":"a7e70f99-2771-4e97-ba6f-3ce2f6ca5675","cardType":"cloze","points":null,"front":"In set notation, the symbol $\\mid$ means \"such that\" and $\\text{[...]}$ means \"is a member of set\".","back":"In set notation, the symbol $\\mid$ means \"such that\" and $\\boxed{\\in}$ means \"is a member of set\".","mcqOptions":[{"text":"$$\\in$","correct":true,"explanation":"The symbol $\\in$ expresses membership: writing $x \\in A$ states that $x$ is an element, or member, of the set $A$."},{"text":"$$\\subseteq$","correct":false,"explanation":"The subset symbol compares two sets rather than an element with a set. Membership is expressed using $\\in$, as in $x \\in A$."},{"text":"$$\\notin$","correct":false,"explanation":"This symbol means “is not a member of”, reversing the required statement. The positive membership relation is represented by $\\in$."},{"text":"$$\\ni$","correct":false,"explanation":"This is the reversed membership symbol, read as “contains as a member”. To say an element is a member of a set, use $\\in$."}]},{"id":"5e5726a2-bc84-4c64-ba60-8541625a13db","cardType":"basic","points":1,"front":"What does the notation $0^n$ represent in string sets?","back":"A sequence of $n$ copies of the symbol 0.","mcqOptions":[{"text":"A sequence of $n$ copies of the symbol 0.","correct":true,"explanation":"In formal-language notation, exponentiation denotes repeated concatenation rather than numerical powers. Thus $0^n$ is the string formed by writing 0 exactly $n$ times."},{"text":"A sequence of $n$ copies of the symbol 1.","correct":false,"explanation":"The exponent gives the number of repetitions but does not change the repeated symbol. The notation $0^n$ contains $n$ copies of 0, not 1."},{"text":"A sequence of $n+1$ copies of the symbol 0.","correct":false,"explanation":"Counting from zero can cause this off-by-one error, but the exponent directly states the string length. The notation represents exactly $n$ copies of 0."},{"text":"A sequence of $2^n$ copies of the symbol 0.","correct":false,"explanation":"This misinterprets the exponent as determining an exponential number of repetitions. In string notation, it directly specifies $n$ concatenated copies of 0."}]},{"id":"4d0617c8-d6e4-4aca-ae69-79eb6f741e06","cardType":"basic","points":1,"front":"What defines a countably infinite set?","back":"An infinite set that can be matched with the natural numbers ($\\mathbb{N}$) in a list.","mcqOptions":[{"text":"An infinite set that can be matched with the natural numbers ($\\mathbb{N}$) in a list.","correct":true,"explanation":"A countably infinite set has a one-to-one correspondence with the natural numbers, so every element can be assigned a finite position in an infinite list."},{"text":"An infinite set that can be matched with the real numbers ($\\mathbb{R}$) in a list.","correct":false,"explanation":"Confusing natural and real numbers overlooks that the real numbers are uncountable. A countably infinite set must instead be matched one-to-one with $\\mathbb{N}$."},{"text":"An infinite set that cannot be arranged in a list indexed by the natural numbers.","correct":false,"explanation":"Being impossible to list describes an uncountable set. A countably infinite set can be listed because its elements correspond one-to-one with the natural numbers."},{"text":"An infinite set that contains the natural numbers as a proper subset ($\\mathbb{N} \\subset A$).","correct":false,"explanation":"Containing $\\mathbb{N}$ does not guarantee countability, since an uncountable set may also contain it. Countable infinity requires a one-to-one correspondence with $\\mathbb{N}$."}]},{"id":"1e3200a9-277e-4710-a0e4-216ea2597016","cardType":"cloze","points":null,"front":"The cardinality of a finite set is the [ ] in the set, often written as $|A|$.","back":"The cardinality of a finite set is the number of elements in the set, often written as $|A|$.","mcqOptions":[{"text":"number of elements","correct":true,"explanation":"Cardinality measures how many distinct elements a finite set contains. The notation $|A|$ therefore represents the number of elements in set $A$."},{"text":"number of subsets","correct":false,"explanation":"This confuses a set with its power set: a set of cardinality $n$ has $2^n$ subsets. Cardinality itself is the number of elements."},{"text":"sum of elements","correct":false,"explanation":"Adding the elements measures a total only when the elements are numerical; it does not measure set size. Cardinality is the number of distinct elements."},{"text":"largest element","correct":false,"explanation":"A largest element concerns ordering and may not even exist, whereas cardinality concerns size. It is the number of distinct elements contained in the set."}]},{"id":"0dbffcc1-46cb-4376-9b38-081936d9177e","cardType":"cloze","points":null,"front":"The cardinality of a finite set is the number of elements in the set, often written as $\\text{[...]}$.","back":"The cardinality of a finite set is the number of elements in the set, often written as $\\boxed{|A|}$.","mcqOptions":[{"text":"$$|A|$","correct":true,"explanation":"Vertical bars around a set name denote its cardinality, so $|A|$ is the standard notation for the number of elements in the finite set $A$."},{"text":"$$A$","correct":false,"explanation":"The symbol $A$ denotes the set itself, not the number of elements it contains. Its cardinality is written using vertical bars as $|A|$."},{"text":"$$\\{A\\}$","correct":false,"explanation":"Braces form a new singleton set whose sole element is $A$; they do not indicate size. The cardinality of $A$ is written $|A|$."},{"text":"$$2^{|A|}$","correct":false,"explanation":"This gives the number of subsets of $A$, because each element may be included or excluded. The cardinality of $A$ itself is written $|A|$."}]},{"id":"8a307661-82c1-41e5-828b-9662147a4fbd","cardType":"basic","points":1,"front":"Define the Cartesian product $X \\times Y$.","back":"The set of all ordered pairs where the first item is from $X$ and the second is from $Y$.","mcqOptions":[{"text":"The set of all ordered pairs where the first item is from $X$ and the second is from $Y$.","correct":true,"explanation":"The Cartesian product $X \\times Y$ contains every ordered pair $(x,y)$ with $x \\in X$ and $y \\in Y$; the order of the components matters."},{"text":"The set of all ordered pairs where the first item is from $Y$ and the second is from $X$.","correct":false,"explanation":"Reversing the component sets defines $Y \\times X$, not $X \\times Y$. In $X \\times Y$, the first item comes from $X$ and the second from $Y$."},{"text":"The set of all unordered pairs where one item is from $X$ and the other is from $Y$.","correct":false,"explanation":"Treating the pairs as unordered loses the distinction between $(x,y)$ and $(y,x)$. A Cartesian product consists of ordered pairs with fixed first and second sets."},{"text":"The set of all ordered pairs where the first and second items are both from $X$.","correct":false,"explanation":"Taking both components from $X$ describes $X \\times X$. For $X \\times Y$, the first component is from $X$ and the second is from $Y$."}]},{"id":"03c85a42-e18a-436a-9785-44c5ced82b7c","cardType":"basic","points":2,"front":"What is the difference between a subset ($\\subseteq$) and a proper subset ($\\subset$)?","back":"A proper subset must be smaller than the original set; it cannot be equal to it.","mcqOptions":[{"text":"A proper subset must be smaller than the original set; it cannot be equal to it.","correct":true,"explanation":"A subset may contain exactly the same elements as the original set, but a proper subset must omit at least one element and therefore cannot equal it."},{"text":"A subset must be smaller than the original set; it cannot be equal to it.","correct":false,"explanation":"This assigns the proper-subset restriction to an ordinary subset. A subset may equal the original set, while a proper subset must be strictly smaller."},{"text":"A proper subset may contain the same elements as the original set; it can be equal to it.","correct":false,"explanation":"Allowing equality describes the ordinary subset relation $\\subseteq$. A proper subset must omit at least one element, so it cannot be equal to the original set."},{"text":"A proper subset must be larger than the original set; it must contain extra elements.","correct":false,"explanation":"This confuses a proper subset with a proper superset. A proper subset contains only elements from the original set and must omit at least one of them."}]},{"id":"d7553fe5-e8d0-4b2a-af67-d5a7b705728c","cardType":"basic","points":1,"front":"What is the set difference $A \\setminus B$?","back":"The set of elements that are in $A$ but not in $B$.","mcqOptions":[{"text":"The set of elements that are in $A$ but not in $B$.","correct":true,"explanation":"Set difference removes from $A$ every element that also belongs to $B$. Thus $A \\setminus B$ retains exactly the elements in $A$ but not in $B$."},{"text":"The set of elements that are in $B$ but not in $A$.","correct":false,"explanation":"This reverses the order and describes $B \\setminus A$. Set difference is not commutative: $A \\setminus B$ contains elements in $A$ but not in $B$."},{"text":"The set of elements that are in both $A$ and $B$.","correct":false,"explanation":"Elements common to both sets form the intersection $A \\cap B$. The difference $A \\setminus B$ instead excludes those shared elements from $A$."},{"text":"The set of elements that are in $A$ or $B$, but not both.","correct":false,"explanation":"Including exclusive elements from both sets gives the symmetric difference. The one-way difference $A \\setminus B$ includes only elements from $A$ that are absent from $B$."}]},{"id":"6bc5255f-9697-4ec0-8884-e274c8feafca","cardType":"cloze","points":null,"front":"In regular expressions, the symbol [ ] matches zero or more repetitions, while + matches one or more repetitions.","back":"In regular expressions, the symbol * matches zero or more repetitions, while + matches one or more repetitions.","mcqOptions":[{"text":"*","correct":true,"explanation":"The Kleene star allows the preceding expression to occur any number of times, including zero. Therefore it matches zero, one, or many repetitions."},{"text":"?","correct":false,"explanation":"The question mark usually makes the preceding expression optional, allowing zero or one occurrence only. The symbol for zero or more repetitions is the Kleene star, *."},{"text":".","correct":false,"explanation":"A dot usually matches a single arbitrary character rather than repeated occurrences. Zero or more repetitions of the preceding expression are indicated by the Kleene star, *."},{"text":"|","correct":false,"explanation":"The vertical bar represents alternation between expressions, rather than repetition. The symbol that permits zero or more repetitions of the preceding expression is *."}]},{"id":"3cdf3ce1-d15e-4974-85aa-4dd1039e93bb","cardType":"cloze","points":null,"front":"In regular expressions, the symbol * matches zero or more repetitions, while [ ] matches one or more repetitions.","back":"In regular expressions, the symbol * matches zero or more repetitions, while + matches one or more repetitions.","mcqOptions":[{"text":"+","correct":true,"explanation":"The plus quantifier requires at least one occurrence of the preceding expression and then permits further occurrences, so it matches one or more repetitions."},{"text":"*","correct":false,"explanation":"The star permits zero occurrences as well as repeated occurrences, so it means zero or more. One or more repetitions require the plus quantifier, +."},{"text":"?","correct":false,"explanation":"The question mark usually permits zero or one occurrence, making an expression optional rather than repeatable without limit. One or more repetitions are indicated by +."},{"text":"|","correct":false,"explanation":"The vertical bar selects between alternative expressions and does not specify a repetition count. The quantifier for one or more occurrences is the plus symbol, +."}]},{"id":"93dac1c0-5eeb-43ed-ac62-4e7c8287b1c0","cardType":"basic","points":1,"front":"In a regular expression, what does the ? metacharacter signify?","back":"The preceding item is optional (matches zero or one repetition).","mcqOptions":[{"text":"The preceding item is optional (matches zero or one repetition).","correct":true,"explanation":"The ? quantifier allows the preceding character, group, or other item to occur either once or not at all, making that item optional."},{"text":"The preceding item is repeatable (matches zero or more repetitions).","correct":false,"explanation":"Zero or more repetitions are specified by the * quantifier. The ? quantifier instead permits zero or one occurrence, making the preceding item optional."},{"text":"The preceding item is repeated (matches one or more repetitions).","correct":false,"explanation":"One or more repetitions are specified by the + quantifier. The ? quantifier instead matches zero or one occurrence of the preceding item."},{"text":"The preceding item is required (matches exactly one repetition).","correct":false,"explanation":"Writing an item without a quantifier requires exactly one occurrence. Adding ? changes this by allowing either zero or one occurrence of that item."}]},{"id":"459044ce-ade8-4375-8883-fcdae6034b69","cardType":"cloze","points":null,"front":"The alternation symbol [ ] in a regex is equivalent to the Boolean operator OR.","back":"The alternation symbol | in a regex is equivalent to the Boolean operator OR.","mcqOptions":[{"text":"|","correct":true,"explanation":"The vertical bar is the regex alternation operator. It separates alternatives, so a match may satisfy the expression on its left or the expression on its right."},{"text":"&","correct":false,"explanation":"The ampersand is associated with AND in some programming contexts, but it is not the regex alternation operator. Regex alternation uses the vertical bar, |."},{"text":"*","correct":false,"explanation":"The asterisk is a quantifier meaning zero or more repetitions of the preceding item. Alternation between two possible patterns is represented by the vertical bar, |."},{"text":"+","correct":false,"explanation":"The plus sign is a quantifier meaning one or more repetitions of the preceding item. The symbol for choosing between alternative regex patterns is |."}]},{"id":"b4e47764-f2f0-4010-984f-43b8fc13503f","cardType":"cloze","points":null,"front":"The alternation symbol | in a regex is equivalent to the Boolean operator [ ].","back":"The alternation symbol | in a regex is equivalent to the Boolean operator OR.","mcqOptions":[{"text":"OR","correct":true,"explanation":"Alternation allows the regex engine to match either the expression before | or the expression after it, corresponding directly to the Boolean operator OR."},{"text":"AND","correct":false,"explanation":"AND would require both conditions to hold together, whereas alternation accepts either of two patterns. Therefore, the regex symbol | corresponds to Boolean OR."},{"text":"NOT","correct":false,"explanation":"NOT negates a condition rather than selecting between alternatives. The regex symbol | offers a choice between its left and right expressions, so it represents OR."},{"text":"XOR","correct":false,"explanation":"XOR requires exactly one of two conditions to be true. Regex alternation simply selects either matching alternative, so its Boolean equivalent is OR rather than XOR."}]},{"id":"81b9b408-9dde-42a7-9a8b-cb9c1ee5828a","cardType":"basic","points":2,"front":"What is the fundamental relationship between regular expressions and FSMs?","back":"They are equivalent; both define the same kind of language (regular languages).","mcqOptions":[{"text":"They are equivalent; both define the same kind of language (regular languages).","correct":true,"explanation":"Every regular expression can be converted into an FSM accepting the same language, and every FSM can be represented by a regular expression. Both therefore characterise regular languages."},{"text":"Regular expressions are more powerful; they define languages that FSMs cannot accept.","correct":false,"explanation":"It is tempting to view regex notation as more powerful because it is compact, but every formal regular expression has an equivalent FSM. Both define exactly the regular languages."},{"text":"FSMs are more powerful; they accept languages that regular expressions cannot define.","correct":false,"explanation":"FSMs may make state transitions more explicit, but that does not increase their expressive power. Every FSM has an equivalent regular expression defining precisely the same language."},{"text":"They are partly equivalent; only some regular expressions can be represented by FSMs.","correct":false,"explanation":"The equivalence is complete, not limited to a subset of expressions. Every formal regular expression can be converted into an FSM that recognises exactly the same strings."}]},{"id":"32325d2a-2e86-487a-aa2d-74891e06e892","cardType":"basic","points":2,"front":"How is a regular language defined?","back":"Any language (set of strings) that can be described by a regular expression or accepted by an FSM.","mcqOptions":[{"text":"Any language (set of strings) that can be described by a regular expression or accepted by an FSM.","correct":true,"explanation":"Regular expressions and finite-state machines have equal expressive power. A language is regular precisely when a regex describes it or an FSM accepts all and only its strings."},{"text":"Any language (set of strings) that can be described by a context-free grammar or accepted by a PDA.","correct":false,"explanation":"Context-free grammars and pushdown automata define context-free languages, a broader class that includes non-regular languages. Regular languages are described by regular expressions or accepted by FSMs."},{"text":"Any language (set of strings) that can be decided by an algorithm or accepted by a Turing machine.","correct":false,"explanation":"Turing machines can recognise languages far beyond the regular class, so computability alone is insufficient. A regular language must be describable by a regex or accepted by an FSM."},{"text":"Any language (set of strings) that has a finite number of valid strings or a fixed maximum string length.","correct":false,"explanation":"All finite languages are regular, but many regular languages are infinite and contain strings of unbounded length. The defining criterion is acceptance by an FSM or description by a regex."}]},{"id":"26b600bf-d5f6-4cb0-939d-b363409fa436","cardType":"basic","points":1,"front":"Which regular expression describes all binary strings ending in 01?","back":"(0|1)*01","mcqOptions":[{"text":"(0|1)*01","correct":true,"explanation":"The subexpression (0|1)* permits any binary prefix, including an empty one, while the final 01 requires every matched string to end with those digits."},{"text":"01(0|1)*","correct":false,"explanation":"Placing 01 first requires strings to begin with 01, after which any binary suffix is allowed. To require the ending, use (0|1)*01."},{"text":"(0|1)*10","correct":false,"explanation":"Reversing the final two digits makes the expression match binary strings ending in 10. Strings ending in 01 are described by (0|1)*01."},{"text":"(0|1)*01(0|1)*","correct":false,"explanation":"The final (0|1)* permits additional digits after 01, so this matches strings containing 01 anywhere. Omitting that suffix requires 01 at the end."}]},{"id":"58ed5d5e-5aae-4ee3-9c62-606c9c913d94","cardType":"cloze","points":null,"front":"The empty set, which contains no elements, is denoted by the symbols $\\text{[...]}$ or $\\emptyset$.","back":"The empty set, which contains no elements, is denoted by the symbols $\\boxed{\\{\\}}$ or $\\emptyset$.","mcqOptions":[{"text":"$$\\{\\}$","correct":true,"explanation":"A pair of braces with nothing between them represents a set containing no elements. It is therefore set notation for the empty set, also denoted by $\\emptyset$."},{"text":"$$\\{0\\}$","correct":false,"explanation":"Braces containing zero describe a singleton set with one element, namely the number $0$. Empty braces, $\\{\\}$, represent the set with no elements."},{"text":"$$\\{\\emptyset\\}$","correct":false,"explanation":"This is a singleton set whose one element is the empty set, so it is not itself empty. The empty set is written $\\{\\}$ or $\\emptyset$."},{"text":"$$\\varepsilon$","correct":false,"explanation":"The symbol $\\varepsilon$ commonly denotes the empty string, which has length zero but is still a string. The empty set is instead written $\\{\\}$ or $\\emptyset$."}]},{"id":"8d3b8361-b59f-4f82-92e0-8204273962a8","cardType":"cloze","points":null,"front":"The empty set, which contains no elements, is denoted by the symbols $\\{\\}$ or $\\text{[...]}$.","back":"The empty set, which contains no elements, is denoted by the symbols $\\{\\}$ or $\\boxed{\\emptyset}$.","mcqOptions":[{"text":"$$\\emptyset$","correct":true,"explanation":"The symbol $\\emptyset$ denotes the unique set containing no elements. It is equivalent to empty-brace notation, $\\{\\}$, but is not the same as an empty string."},{"text":"$$\\varepsilon$","correct":false,"explanation":"The symbol $\\varepsilon$ denotes the empty string in formal-language theory, not a set with no elements. The standard single-symbol notation for the empty set is $\\emptyset$."},{"text":"$$0$","correct":false,"explanation":"The numeral $0$ is a number and may itself be an element of a set. A set containing no elements is denoted by $\\emptyset$ or $\\{\\}$."},{"text":"$$\\{\\emptyset\\}$","correct":false,"explanation":"Putting $\\emptyset$ inside braces creates a set containing one element, namely the empty set. The set with no elements is written simply as $\\emptyset$."}]},{"id":"b37203bf-5ddb-47cc-b473-808a3e9e4b62","cardType":"basic","points":2,"front":"Explain the difference between set union ($\\cup$) and set intersection ($\\cap$).","back":"

Union: all elements appearing in either set.
Intersection: only elements appearing in both sets.

","mcqOptions":[{"text":"

Union: all elements appearing in either set.
Intersection: only elements appearing in both sets.

","correct":true,"explanation":"Union combines every element found in at least one of the sets, whereas intersection contains only elements shared by all the sets being compared."},{"text":"

Union: only elements appearing in both sets.
Intersection: all elements appearing in either set.

","correct":false,"explanation":"This reverses the two operations. Union includes elements from either set, while intersection is restricted to elements that appear in both sets."},{"text":"

Union: only elements appearing in one set.
Intersection: all elements appearing in both sets.

","correct":false,"explanation":"This confuses union with symmetric difference, which excludes shared elements. Union includes every element in either set, while intersection includes only elements in both."},{"text":"

Union: all elements appearing in the first set.
Intersection: only elements appearing in the second set.

","correct":false,"explanation":"Set operations do not depend on which set is labelled first or second. Union includes elements from either set, and intersection includes elements common to both."}]}]}],"examCountdown":{"examDate":"2027-06-07","paperLabel":"Paper 1"},"heading":"Regular languages","title":"Regular languages Flashcards","topbar":{"backHref":"/a-level/computer-science/aqa/flashcards"},"topicSidebar":"$L37"}]}],"topicId":"4e5224a2-9c64-567f-aaff-158ede25e62c","walled":"$L38"}],"$L39","$L3a"]