There are many string-rewriting esolangs; however, I only include those which can express patterns more complex than literal strings and which match languages of any alphabet. Regular expressions could be converted to Markov algorithms a Post canonical system (which are both Turing-complete, so the reverse is not always possible).
- _ 2
- (()) 2
- @text 2
- /// 2
- 1.1 2
- 111 2
- 1cnis 2
- 2022 2
- 2C 2
- 7 2
- Antigram 2
- ASM 2
- AutomataFuck 2
- Beautiful day 2
- BitBounce 2
- Bitwise Trance 2
- Categorial 2
- Cells 2
- Classical CT 2
- Definer 2
- Egaharjb 2
- Encapsulation 2
- FThue 2
- Fuun DNA 2
- Grammar 2
- Grr 2
- Grue 2
- Gummy Bear 3 2
- HashWalk 2
- HELP (Preprocessor) 2
- Itflabtijtslwi 2
- Leszek 2
- Lete 2
- Liberation 2
- Lines 2
- Marthue 2
- McCulloch's second machine 2
- McCulloch's third machine 2
- Muriel 2
- Myth 2
- Night Shift 2
- Noisett 2
- NRSRSSOMN 2
- Number Seventy-Four 3 2
- Numeric Batch 2
- Object oriented Thue 2
- Parentheses only 2
- PISW 2
- Precognition 2
- Procedural Footnote Language 2
- PROLAN/M 3 2
- Random 2
- REBEL 2
- RegexPL 2
- REsKrIb!lo 2
- Semper dissolubilis 2
- SIMPLE (preprocessor) 2
- Something positive 3 2
- Sonata 3 2
- Squishy2K 2
- Strvar 3 2
- StubScript 2
- Sultan's daughter 2
- Swap 2
- Tandem 2
- Tarski 2
- The Subtyping Machine 2
- Thubi 2
- Thue 3 2
- Thutu 2
- Treesolang 2
- Triskaidekalogophilia 2
- Twoee 2
- Udymts 2
- Varigen 2
- Zone 2
Footnotes
-
https://esolangs.org/wiki/Special:WhatLinksHere/Regular_expression ↩ ↩2 ↩3 ↩4 ↩5 ↩6
-
https://esolangs.org/wiki/Category:String-rewriting_paradigm ↩ ↩2 ↩3 ↩4 ↩5 ↩6 ↩7 ↩8 ↩9 ↩10 ↩11 ↩12 ↩13 ↩14 ↩15 ↩16 ↩17 ↩18 ↩19 ↩20 ↩21 ↩22 ↩23 ↩24 ↩25 ↩26 ↩27 ↩28 ↩29 ↩30 ↩31 ↩32 ↩33 ↩34 ↩35 ↩36 ↩37 ↩38 ↩39 ↩40 ↩41 ↩42 ↩43 ↩44 ↩45 ↩46 ↩47 ↩48 ↩49 ↩50 ↩51 ↩52 ↩53 ↩54 ↩55 ↩56 ↩57 ↩58 ↩59 ↩60 ↩61 ↩62 ↩63 ↩64 ↩65 ↩66 ↩67 ↩68 ↩69 ↩70 ↩71 ↩72 ↩73 ↩74 ↩75 ↩76
-
https://esolangs.org/wiki/Special:WhatLinksHere/Rewriting ↩ ↩2 ↩3 ↩4 ↩5 ↩6 ↩7