Pertanyaan yang diberi tag regular-expressions

11
Inferring type refinement

Di tempat kerja saya ditugaskan untuk menyimpulkan beberapa jenis informasi tentang bahasa yang dinamis. Saya menulis ulang urutan pernyataan menjadi letekspresi bersarang , seperti: return x; Z => x var x; Z => let x = undefined in Z x = y; Z => let x = y in Z if x then T else F; Z =>...

programming-languages logic type-theory type-inference machine-learning data-mining clustering order-theory reference-request information-theory entropy algorithms algorithm-analysis space-complexity lower-bounds formal-languages computability formal-grammars context-free parsing complexity-theory time-complexity terminology turing-machines nondeterminism programming-languages semantics operational-semantics complexity-theory time-complexity complexity-theory reference-request turing-machines machine-models simulation graphs probability-theory data-structures terminology distributed-systems hash-tables history terminology programming-languages meta-programming terminology formal-grammars compilers algorithms search-algorithms formal-languages regular-languages complexity-theory satisfiability sat-solvers factoring algorithms randomized-algorithms streaming-algorithm in-place algorithms numerical-analysis regular-languages automata finite-automata regular-expressions algorithms data-structures efficiency coding-theory algorithms graph-theory reference-request education books formal-languages context-free proof-techniques algorithms graph-theory greedy-algorithms matroids complexity-theory graph-theory np-complete intuition complexity-theory np-complete traveling-salesman algorithms graphs probabilistic-algorithms weighted-graphs data-structures time-complexity priority-queues computability turing-machines automata pushdown-automata algorithms graphs binary-trees algorithms algorithm-analysis spanning-trees terminology asymptotics landau-notation algorithms graph-theory network-flow terminology computability undecidability rice-theorem algorithms data-structures computational-geometry
9
Kapan regexp bukan Ekspresi Reguler?

Karena saya sedang belajar untuk kursus bahasa formal di perguruan tinggi, saya menemukan tulisan-tulisan menarik ini ( Satu Dua ) yang menggambarkan bagaimana menemukan bilangan prima menggunakan regexp . Seperti yang saya katakan, regexp , bukan ekspresi reguler . Karena ekspresi reguler dapat...

regular-expressions
9
Apakah

Saya mengambil ujian teori perhitungan saya beberapa minggu yang lalu, dan ini adalah salah satu pertanyaan: Asumsikan bahasa L = { ( anbm)r∣ n , m , r ≥ 0 }L={(anbm)r∣n,m,r≥0}L=\{(a^nb^m)^r \mid n,m,r\ge 0\} Apakah L teratur? Jika ya, berikan ekspresi reguler atau otomat untuk...

formal-languages regular-languages regular-expressions