tmp curr goto [[전산학,compsci#s-7]]

chk
{
정규식이
FSA finite-state_automaton finite_state_automaton 과 equivalent?
}
----
[[RR:정규식,regular_expression,regex]] <- external links, bookmarks

mklink
[[정규문법,regular_grammar]]
[[정규언어,regular_language]]
'''Regex'''가 [[정규언어,regular_language]]를 describe? chk
[[식,expression]]
[[문법,grammar]]
[[문자열,string]]
[[문자,character]]
[[Kleene_star]] - writing; curr see https://foldoc.org/Kleene+star WtEn:Kleene_star WpEn:Kleene_star // is_a [[연산자,operator]]
Kleene_plus - WtEn:Kleene_plus 
[[Kleene_closure]] - writing; curr see WtEn:Kleene_closure // is_a [[closure]] ... 이상 둘은 본질적으로 같음, so 서로 mkl
[[메타문자,metacharacter]] w
 WpKo:메타문자

----
비슷한 기능을 / 대안
[[Wiki:AlternativesToRegularExpressions]]

----
Bmks > Online tools
Regular Expression Laboratory - A JavaScript-based regular expression testing area - Paul Lutus
https://arachnoid.com/regex_lab/index.html

tmp bmks en
https://everything2.com/title/the+expressive+power+of+regular+expressions
 // '''regex'''의 [[expressive_power]], or [[expressiveness]] or [[expressivity]] { 표현력? 표현능력?[* https://terms.naver.com/entry.naver?docId=822869&cid=50376&categoryId=50376] : [[언어,language]]의 성질 - 얼마나 넓은 범위를 [[표현,expression]]할 수 있는지 ... Google:expressive+power Google:expressiveness+of+language WpKo:표현_능력 WpEn:Expressivity } 에 대한.

----
AKA '''regex, regexp'''

Twins:
p RegularExpression
https://esolangs.org/wiki/Regular_expression
https://mathworld.wolfram.com/RegularExpression.html ....[[형식언어,formal_language]]를 정의 - as - 유한한 [[알파벳,alphabet]]위 [[문자열,string]]들의 [[집합,set]]으로
http://foldoc.org/regular+expressions
https://planetmath.org/regularexpression
https://everything2.com/title/regex and https://everything2.com/title/regular+expression
[[Wiki:RegularExpression]]
http://biohackers.net/wiki/RegularExpression

Up:
[[regularity]]
[[식,expression]]
형식언어론 formal_language_theory ? (via e2 regex) - [[형식언어,formal_language]]