Perl Regular Expression Matching is NP-Hard
Matching ordinary regular expresions can be done in polynomial time, proportional to MN, where M is the length of the regular expression and N is the length of the string to be matched. The usual method for this is: Parse the regular expression and construct an equivalent finite automaton (FA), which will have O(M) states; then simulate the action of the FA on the input, which takes O(MN) time. My
後方å‚ç…§ã®ã‚ã‚‹æ£è¦è¡¨ç¾ã®èƒ½åŠ› - ã¾ã‚ã‚ã‚‚
定期的ã«å‡ºã¦ãる話題ã§ã™ãŒã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§å‡ºã¦ãã‚‹æ£è¦è¡¨ç¾ã¯æ£è¦è¡¨ç¾ã§ã¯ãªã„ã®ã§ã€ç´ 数判定ãŒã§ãã¾ã™ã€‚æ£ç¢ºã«ã¯ã€æ–‡å—列ã®é•·ã•ãŒç´ æ•°ã‹ã©ã†ã‹ã‚’判定ã§ãã¾ã™ã€‚2 æ–‡å—以上ã®ãƒžãƒƒãƒãŒ 2 回以上出ç¾ã™ã‚‹ã‹ã©ã†ã‹ã‚’見ã¾ã™ã€‚後方å‚ç…§ãŒãƒã‚¤ãƒ³ãƒˆã€‚ p (2..30).select{|x| !("X" * x)[/^(..+)\1+$/] } #=> [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] ã¨ã“ã‚ã§ã€{ a^n | n ã¯ç´ æ•° } ã¯æ–‡è„ˆä¾å˜è¨€èªžã®ã¯ãšãªã®ã§ã€å¾Œæ–¹å‚ç…§ã®ã‚ã‚‹æ£è¦è¡¨ç¾ã¯ç·šå½¢æ‹˜æŸã‚ªãƒ¼ãƒˆãƒžãƒˆãƒ³ä»¥ä¸Šã®è¡¨ç¾åŠ›ã‚’æŒã¤ã“ã¨ã«ãªã‚‹ã®ã§ã—ょã†ã‹ã€‚ã§ã‚‚ã€æ–‡è„ˆè‡ªç”±æ–‡æ³•ã§ã‚ã‚‹ { a^nb^n | n ã¯è‡ªç„¶æ•° } や括弧ã®å¯¾å¿œã¯æ›¸ã‘ãªã•ãã†ã§ã™ã€‚ã¡ã‚‡ã£ã¨èª¿ã¹ã¦ã¿ã¦ã‚‚ã€å¾Œæ–¹å‚ç…§ã®ã‚ã‚‹æ£è¦è¡¨ç¾ã®èƒ½åŠ›ã¯ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ ã¨ã‚Šã‚ãˆãšPerl ã®æ£è¦è¡¨ç¾ãƒžãƒƒãƒãƒ³ã‚°ã§ 3-CN
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}