List Question
10 TechQA 2024-12-30 18:25:58L = {www| w belongs to {0,1}*} prove via pumping lemma
301 views
Asked by hyeri
How to design a regex used for searching a pattern, rather than validating a pattern?
287 views
Asked by JackWM
Is $E_{LBA}$ a Turing recognizable language?
1.2k views
Asked by rich
Bisimulation in state transition system
320 views
Asked by Jamgreen
Lexical analyser : how to identify the end of a token
514 views
Asked by Sierra
Is ε terminal in context-free?
3.7k views
Asked by alkokura49
How can I build string matching tree from array of regex-es?
469 views
Asked by kravemir
Simple explanation of PDA accept states?
301 views
Asked by user3470131
automata theorem: existance of a DFA
294 views
Asked by OmriSoudry
Design DFA that checks wheter a boolean formula is true or false
403 views
Asked by Stenli