BibSLEIGH — regular expression tag

regular expression

regular expression

Tag #regular expression

272 papers:

ICPC-2019-BaiCSCWS #composition #tool support: Exploring tools and strategies used during regular expression composition tasks (GRB, BC, NS, CC, CW, KTS), pp. 197–208.
SANER-2019-WangBS #evolution: Exploring Regular Expression Evolution (PW, GRB, KTS), pp. 502–513.
CIAA-2019-BorsottiBCM #benchmark #metric: A Benchmark Production Tool for Regular Expressions (AB, LB, SCR, AM), pp. 95–107.
CIAA-2019-KonstantinidisM19a #invariant: Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels (SK, NM, JP, RR), pp. 184–196.
DLT-2019-GastinMG #logic: Logics for Reversible Regular Languages and Semigroups with Involution (PG, AM, RG), pp. 182–191.
OOPSLA-2019-PanHXD #automation: Automatic repair of regular expressions (RP, QH, GX, LD), p. 29.
PEPM-2019-Radanne #parsing: Typed parsing and unparsing for untyped regular expression engines (GR), pp. 35–46.
PLDI-2019-LoringMK #execution #javascript #semantics #symbolic computation: Sound regular expression semantics for dynamic symbolic execution of JavaScript (BL, DM, JK), pp. 425–438.
ASE-2019-DavisMKL #metric #scalability #testing: Testing Regex Generalizability And Its Implications: A Large-Scale Many-Language Measurement Study (JCD, DM, AMK, DL), pp. 427–439.
ASE-2019-MichaelDDLS #programming #risk management: Regexes are Hard: Decision-Making, Difficulties, and Risks in Programming Regular Expressions (LGMI, JD, JCD, DL, FS), pp. 415–426.
ESEC-FSE-2019-Davis: Rethinking Regex engines to address ReDoS (JCD), pp. 1256–1258.
ESEC-FSE-2019-DavisMCSL #empirical #why: Why aren't regular expressions a lingua franca? an empirical study on the re-use and portability of regular expressions (JCD, LGMI, CAC, FS, DL), pp. 443–454.
ICTSS-2019-ArcainiGR #learning #testing: Regular Expression Learning with Evolutionary Testing and Repair (PA, AG, ER), pp. 22–40.
SCAM-2018-Larson #automation #research: [Research Paper] Automatic Checking of Regular Expressions (EL), pp. 225–234.
CIAA-2018-DeBenedettoC #algorithm #automaton #multi: Algorithms and Training for Weighted Multiset Automata and Regular Expressions (JD, DC0), pp. 146–158.
CIAA-2018-KonstantinidisM #invariant #transducer: Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels (SK, NM, RR, JY), pp. 4–27.
CIAA-2018-Sinnamon #complexity: Complexity of Proper Suffix-Convex Regular Languages (CS), pp. 324–338.
DLT-2018-BellLS #approximate: Additive Number Theory via Approximation by Regular Languages (JPB, TFL, JOS), pp. 121–132.
DLT-2018-ColbournDLS: Counting Subwords and Regular Languages (CJC, RED, TFL, JOS), pp. 231–242.
DLT-2018-HanK0S #problem #string: Closest Substring Problems for Regular Languages (YSH, SKK, TN0, KS), pp. 392–403.
CIG-2018-KowalskiK #learning: Regular Language Inference for Learning Rules of Simplified Boardgames (JK, AK), pp. 1–8.
ASE-2018-Shen000ML #named: ReScue: crafting regular expression DoS attacks (YS, YJ0, CX0, PY0, XM, JL0), pp. 225–235.
ESEC-FSE-2018-DavisCSL #ecosystem #empirical: The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale (JCD, CAC, FS, DL), pp. 246–256.
ESEC-FSE-2018-WangS #how #question: How well are regular expressions tested in the wild? (PW, KTS), pp. 668–678.
GPCE-2018-RadanneT #generative #named: Regenerate: a language generator for extended regular expressions (GR, PT), pp. 202–214.
SLE-2018-Sakharov: Input-driven regular expressions (AS), pp. 42–46.
CSL-2018-ChadhaS0 #approximate #automaton #probability: Approximating Probabilistic Automata by Regular Languages (RC, APS, MV0), p. 23.
ICTSS-2018-ArcainiGR #interactive #testing: Interactive Testing and Repairing of Regular Expressions (PA, AG, ER), pp. 1–16.
AFL-2017-LavadoPP: Weakly and Strongly Irreversible Regular Languages (GJL, GP, LP), pp. 143–156.
CIAA-2017-BerglundMWW #on the #semantics: On the Semantics of Atomic Subgroups in Practical Regular Expressions (MB, BvdM, BWW, NW), pp. 14–26.
CIAA-2017-BrzozowskiS #complexity: Complexity of Proper Prefix-Convex Regular Languages (JAB, CS), pp. 52–63.
CIAA-2017-FerensS #complexity: Complexity of Bifix-Free Regular Languages (RF, MS), pp. 76–88.
DLT-2017-Beier0 #complexity #on the #proving: On Regular Expression Proof Complexity (SB, MH0), pp. 83–95.
SEFM-2017-BozzelliMMP #logic #model checking: An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions (LB, AM, AM, AP), pp. 104–119.
ASE-2017-ChapmanWS #comprehension: Exploring regular expression comprehension (CC, PW, KTS), pp. 405–416.
CAV-2017-Ulus #monitoring #named: Montre: A Tool for Monitoring Timed Regular Expressions (DU), pp. 329–335.
CIAA-2016-Ng #distance: Prefix Distance Between Regular Languages (TN0), pp. 224–235.
CIAA-2016-SulzmannL #ambiguity: Derivative-Based Diagnosis of Regular Expression Ambiguity (MS, KZML), pp. 260–272.
CIAA-2016-Thiemann: Derivatives for Enhanced Regular Expressions (PT0), pp. 285–297.
CIAA-2016-WeidemanMBW #ambiguity #automaton #backtracking #behaviour #nondeterminism #using: Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (NW, BvdM, MB, BWW), pp. 322–334.
DLT-2016-BrodaMMR #automaton: Position Automaton Construction for Regular Expressions with Intersection (SB, AM, NM, RR), pp. 51–63.
DLT-2016-Jirasek #set: Non-regular Maximal Prefix-Free Subsets of Regular Languages (JJJ), pp. 229–242.
PADL-2016-SerranoH #data type #haskell: Generic Matching of Tree Regular Expressions over Haskell Data Types (AS0, JH), pp. 83–98.
PPDP-2016-MidtgaardNN #analysis #process: Iterated process analysis over lattice-valued regular expressions (JM, FN, HRN), pp. 132–145.
SAS-2016-MidtgaardNN #abstract domain #parametricity: A Parametric Abstract Domain for Lattice-Valued Regular Expressions (JM, FN, HRN), pp. 338–360.
GPCE-2016-LeeSO #automaton: Synthesizing regular expressions from examples for introductory automata assignments (ML, SS, HO), pp. 70–80.
ICST-2016-LarsonK #generative #string: Generating Evil Test Strings for Regular Expressions (EL, AK), pp. 309–319.
DRR-2015-BideaultMCP #architecture #using #word: Spotting handwritten words and REGEX using a two stage BLSTM-HMM architecture (GB, LM, CC, TP).
CIAA-J-2013-JirasekJ15 #bound #on the: On the boundary of regular languages (JJ, GJ), pp. 42–57.
CIAA-2015-BerglundM #on the #parsing #semantics: On the Semantics of Regular Expression Parsing in the Wild (MB, BvdM), pp. 292–304.
CIAA-2015-BorsottiBCM #ambiguity #automaton #parsing: From Ambiguous Regular Expressions to Deterministic Parsing Automata (AB, LB, SCR, AM), pp. 35–48.
CIAA-2015-BorsottiBCM15a #ambiguity #named #parsing: BSP: A Parsing Tool for Ambiguous Regular Expressions (AB, LB, SCR, AM), pp. 313–316.
CIAA-2015-Hulden #automaton #finite: From Two-Way to One-Way Finite Automata — Three Regular Expression-Based Methods (MH), pp. 176–187.
CIAA-2015-Watson #automaton #finite #hardware #implementation: Hardware Implementations of Finite Automata and Regular Expressions — Extended Abstract (BWW), pp. 13–17.
LATA-2015-ThiemannS #automaton: From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.
AIIDE-2015-OsbornSMW #game studies #named: Playspecs: Regular Expressions for Game Play Traces (JCO, BS, MM, NWF), pp. 170–176.
CHI-2015-ZgraggenDFD #query #sequence #visual notation: (s|qu)eries: Visual Regular Expressions for Querying and Exploring Event Sequences (EZ, SMD, DF, RD), pp. 2683–2692.
HCI-DE-2015-WatabeM #user interface #visual notation: Graphical User Interface for Search of Mathematical Expressions with Regular Expressions (TW, YM), pp. 438–447.
CIKM-2015-BjorklundMT #evaluation #incremental #performance: Efficient Incremental Evaluation of Succinct Regular Expressions (HB, WM, TT), pp. 1541–1550.
CAV-2015-ZhengGSTDZ #constraints #effectiveness #equation #string: Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints (YZ, VG, SS, OT, JD, XZ), pp. 235–254.
LICS-2015-Place #quantifier: Separating Regular Languages with Two Quantifiers Alternations (TP), pp. 202–213.
DLT-J-2013-TanV14 #graph #query: Regular Expressions for Querying Data graphs (TT, DV), pp. 971–986.
AFL-2014-BerglundDM #backtracking #behaviour: Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching (MB, FD, BvdM), pp. 109–123.
AFL-2014-GruberH #automaton #complexity #finite #summary: From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.
AFL-2014-HolzerJ #automaton #product line: More Structural Characterizations of Some Subregular Language Families by Biautomata (MH, SJ), pp. 271–285.
AFL-2014-Valdats #complexity: Boolean Circuit Complexity of Regular Languages (MV), pp. 342–354.
CIAA-2014-CevorovaJK #on the: On the Square of Regular Languages (KC, GJ, IK), pp. 136–147.
DLT-2014-Schmid: Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing (MLS), pp. 142–153.
LATA-2014-Weidner #probability: Probabilistic ω-Regular Expressions (TW), pp. 588–600.
FLOPS-2014-SulzmannL #parsing: POSIX Regular Expression Parsing with Derivatives (MS, KZML), pp. 203–220.
VISSOFT-2014-ToprakWS #assembly #control flow #lightweight #visualisation: Lightweight Structured Visualization of Assembler Control Flow Based on Regular Expressions (ST, AW, SS), pp. 97–106.
CC-2014-SulzmannS #flexibility #ml #performance: A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching (MS, PvS), pp. 174–191.
TACAS-2014-MalerM #learning #scalability: Learning Regular Languages over Large Alphabets (OM, IEM), pp. 485–499.
CAV-2014-LiangRTBD #formal method #string: A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions (TL, AR, CT, CB, MD), pp. 646–662.
LICS-CSL-2014-PlaceZ #first-order #logic: Separating regular languages with first-order logic (TP, MZ), p. 10.
ICDAR-2013-KessentiniCP #detection #documentation #word: Word Spotting and Regular Expression Detection in Handwritten Documents (YK, CC, TP), pp. 516–520.
CIAA-J-2012-Brzozowski13: In Search of Most Complex Regular Languages (JAB), pp. 691–708.
DLT-J-2012-BrzozowskiT13 #complexity: Complexity of atoms of Regular Languages (JAB, HT), pp. 1009–1028.
DLT-J-2012-HanKS13 #context-free grammar: The Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 1067–1082.
DLT-J-2012-Schmid13: Inside the Class of regex Languages (MLS), pp. 1117–1134.
CIAA-2013-GrathwohlHNR #parsing: Two-Pass Greedy Regular Expression Parsing (NBBG, FH, LN, UTR), pp. 60–71.
CIAA-2013-JirasekJ #bound #on the: On the Boundary of Regular Languages (JJ, GJ), pp. 208–219.
DLT-2013-BerglundBDMW: Cuts in Regular Expressions (MB, HB, FD, BvdM, BW), pp. 70–81.
DLT-2013-LibkinTV #database #graph #query #word: Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
DLT-2013-Pin: An Explicit Formula for the Intersection of Two Polynomials of Regular Languages (JÉP), pp. 31–45.
ICALP-v2-2013-CzerwinskiMM #performance #sequence: Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.
ICALP-v2-2013-EtessamiSY #context-free grammar #probability: Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.
LATA-2013-ChamparnaudDJM: Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (JMC, JPD, HJ, LM), pp. 202–213.
LATA-2013-HaberHMMR #performance: Efficient Submatch Extraction for Practical Regular Expressions (SH, WH, PKM, MM, PR), pp. 323–334.
LATA-2013-MontanariS #logic: Interval Logics and ωB-Regular Languages (AM, PS), pp. 431–443.
ICFP-2013-TraytelN #word: Verified decision procedures for MSO on words based on derivatives of regular expressions (DT, TN), pp. 3–12.
PPDP-2013-MontenegroPS #analysis #functional #using: Shape analysis in a functional language by using regular languages (MM, RP, CS), pp. 251–262.
PPoPP-2013-YuB #automaton #performance: Exploring different automata representations for efficient regular expression matching on GPUs (XY, MB), pp. 287–288.
FoSSaCS-2013-CzerwinskiDLM: Deciding Definability by Deterministic Regular Expressions (WC, CD, KL, WM), pp. 289–304.
TACAS-2013-GangeNSSS #bound #constraints #model checking: Unbounded Model-Checking with Interpolation for Regular Language Constraints (GG, JAN, PJS, HS, PS), pp. 277–291.
PODS-2012-GrozMS #linear: Deterministic regular expressions in linear time (BG, SM, SS), pp. 49–60.
CIAA-2012-Brzozowski: In Search of Most Complex Regular Languages (JAB), pp. 5–24.
CIAA-2012-LiuSGF #automaton #named: SDFA: Series DFA for Memory-Efficient Regular Expression Matching (TL, YS, LG, BF), pp. 337–344.
DLT-2012-BealCDJL #decidability #geometry: Decidability of Geometricity of Regular Languages (MPB, JMC, JPD, HJ, SL), pp. 62–72.
DLT-2012-BrzozowskiT: Quotient Complexities of Atoms of Regular Languages (JAB, HT), pp. 50–61.
DLT-2012-ChenL: Checking Determinism of Regular Expressions with Counting (HC, PL), pp. 332–343.
DLT-2012-HanKS #context-free grammar: Computing the Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 85–96.
DLT-2012-Schmid: Inside the Class of REGEX Languages (MLS), pp. 73–84.
ICALP-v2-2012-BojanczykP #infinity #set: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.
ICALP-v2-2012-DiekertKRW: Regular Languages Are Church-Rosser Congruential (VD, MK, KR, TW), pp. 177–188.
LATA-2012-ChamparnaudJM #approximate: Approximate Regular Expressions and Their Derivatives (JMC, HJ, LM), pp. 179–191.
LATA-2012-DubeLT: Conservative Groupoids Recognize Only Regular Languages (DD, ML, PT), pp. 216–227.
LATA-2012-Hovland #constraints #problem: The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints (DH), pp. 313–324.
GT-VMT-2012-JalaliRG #incremental #pattern matching: Incremental Pattern Matching for Regular Expressions (AJ, AR, AHG).
CHI-2012-KinHDA #gesture #multi #named: Proton: multitouch gestures as regular expressions (KK, BH, TD, MA), pp. 2885–2894.
ICML-2012-PrasseSLS #email #identification #learning: Learning to Identify Regular Expressions that Describe Email Campaigns (PP, CS, NL, TS), p. 146.
PPDP-2012-SulzmannL #using: Regular expression sub-matching using partial derivatives (MS, KZML), pp. 79–90.
DAC-2012-PurandareAH #correctness #proving: Proving correctness of regular expression accelerators (MP, KA, CH), pp. 350–355.
PPoPP-2012-ZuYXWTPD #automaton #implementation #memory management #nondeterminism #performance: GPU-based NFA implementation for memory efficient high speed regular expression matching (YZ, MY, ZX, LW, XT, KP, QD), pp. 129–140.
FASE-2012-ErwigG: Explanations for Regular Expressions (ME, RG), pp. 394–408.
FoSSaCS-2012-KurzST #on the: On Nominal Regular Languages with Binders (AK, TS, ET), pp. 255–269.
SMT-2012-BjornerGMV #sequence: SMT-LIB Sequences and Regular Expressions (NB, VG, RM, MV), pp. 77–87.
DLT-J-2009-Fazekas11: Powers of Regular Languages (SZF), pp. 323–330.
CIAA-J-2010-DiekertK11: It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular (VD, SK), pp. 1813–1828.
CIAA-J-2010-DrosteM11 #automaton #monad: Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.
DLT-J-2010-JiraskovaM11 #complexity: Complexity in Union-Free Regular Languages (GJ, TM), pp. 1639–1653.
AFL-2011-BrzozowskiJLS #complexity: Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.
DLT-2011-BattaglinoFFR #encoding: Encoding Centered Polyominoes by Means of a Regular Language (DB, JMF, AF, SR), pp. 464–465.
DLT-2011-HundeshagenO #automaton: Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.
DLT-2011-SelivanovK #algebra: Boolean Algebras of Regular Languages (VLS, AK), pp. 386–396.
DLT-2011-Wilke #functional: A Functional Program for Regular Expressions Matching — Abstract of Invited Talk (TW), pp. 44–45.
ICALP-v2-2011-CartonCP #linear #order #word: Regular Languages of Words over Countable Linear Orderings (OC, TC, GP), pp. 125–136.
LATA-2011-CaronCM: Partial Derivatives of an Extended Regular Expression (PC, JMC, LM), pp. 179–191.
LATA-2011-Gelderie #automaton: Classifying Regular Languages via Cascade Products of Automata (MG), pp. 286–297.
LATA-2011-NielsenH #parsing: Bit-coded Regular Expression Parsing (LN, FH), pp. 402–413.
CIKM-2011-BrauerRMB #information management: Enabling information extraction by inference of regular expressions from sample entities (FB, RR, AM, WMB), pp. 1285–1294.
CIKM-2011-TsangC #query #robust: A robust index for regular expression queries (DT, SC), pp. 2365–2368.
POPL-2011-HengleinN #axiom #induction: Regular expression containment: coinductive axiomatization and computational interpretation (FH, LN), pp. 385–398.
VLDB-2010-MozafariZZ #execution #query #relational #sequence #word #xml: From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences (BM, KZ, CZ), pp. 150–161.
AFL-J-2008-AfoninK10 #on the: On the Structure of Finitely Generated Semigroups of Unary Regular Languages (SA, EK), pp. 689–704.
AFL-J-2008-Lohrey10 #automaton #problem: Compressed Membership Problems for Regular Expressions and Hierarchical Automata (ML), pp. 817–841.
DLT-J-2008-Ada10 #communication #complexity #nondeterminism #on the: On the Non-Deterministic Communication Complexity of Regular Languages (AA), pp. 479–493.
CIAA-2010-CimattiMRT #automaton #nondeterminism: From Sequential Extended Regular Expressions to NFA with Symbolic Labels (AC, SM, MR, ST), pp. 87–94.
CIAA-2010-DiekertK #complexity: Complexity Results and the Growths of Hairpin Completions of Regular Languages (VD, SK), pp. 105–114.
CIAA-2010-DrosteM: Regular Expressions on Average and in the Long Run (MD, IM), pp. 211–221.
CIAA-2010-LiuGLT #automaton #composition #matrix: Compressing Regular Expressions’ DFA Table by Matrix Decomposition (YL, LG, PL, JT), pp. 282–289.
CIAA-2010-Maout #design: Regular Expressions at Their Best: A Case for Rational Design (VLM), pp. 310–320.
CIAA-2010-OkuiS #ambiguity #automaton: Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (SO, TS), pp. 231–240.
CIAA-2010-ReidenbachS #polynomial #scalability: A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (DR, MLS), pp. 241–250.
DLT-2010-JiraskovaM #complexity: Complexity in Union-Free Regular Languages (GJ, TM), pp. 255–266.
DLT-2010-PribavkinaR #complexity: State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.
LATA-2010-ChamparnaudDJ #geometry: Geometricity of Binary Regular Languages (JMC, JPD, HJ), pp. 178–189.
LATA-2010-GruberG: Simplifying Regular Expressions (HG, SG), pp. 285–296.
LATA-2010-Hovland #problem: The Inclusion Problem for Regular Expressions (DH), pp. 309–320.
LATA-2010-MiloPZ #constraints #named #sequence: SA-REPC — Sequence Alignment with Regular Expression Path Constraint (NM, TP, MZU), pp. 451–462.
RTA-2010-KutsiaM #order #unification: Order-Sorted Unification with Regular Expression Sorts (TK, MM), pp. 193–208.
ICFP-2010-FischerHW #functional #game studies: A play on regular expressions: functional pearl (SF, FH, TW), pp. 357–368.
PPDP-2010-BrabrandT #ambiguity #pattern matching #string #using: Typed and unambiguous pattern matching on strings using regular expressions (CB, JGT), pp. 243–254.
ICST-2010-VeanesHT #named: Rex: Symbolic Regular Expression Explorer (MV, PdH, NT), pp. 498–507.
SIGMOD-2009-BexGMN #nondeterminism #xml: Simplifying XML schema: effortless handling of nondeterministic regular expressions (GJB, WG, WM, FN), pp. 731–744.
CIAA-J-2008-ChamparnaudDJ09 #algorithm #geometry #performance: An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.
CIAA-2009-GruberHT #automaton #empirical #finite: Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.
CIAA-2009-VuilleminG #automaton #normalisation: Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.
DLT-2009-BehleKR #quantifier: Regular Languages Definable by Majority Quantifiers with Two Variables (CB, AK, SR), pp. 91–102.
DLT-2009-Fazekas: Powers of Regular Languages (SZF), pp. 221–227.
DLT-2009-GruberH #bound #complexity: Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.
ICALP-v1-2009-BilleT #performance: Faster Regular Expression Matching (PB, MT), pp. 171–182.
ICALP-v2-2009-BrancoP #equation #polynomial: Equations Defining the Polynomial Closure of a Lattice of Regular Languages (MJJB, JÉP), pp. 115–126.
LATA-2009-AfoninG: Minimal Union-Free Decompositions of Regular Languages (SA, DG), pp. 83–92.
LATA-2009-CarleN #on the: On Extended Regular Expressions (BC, PN), pp. 279–289.
LATA-2009-HanSY #complexity: State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
CIKM-2009-ColazzoGPS #linear #xml: Linear inclusion for XML regular expression types (DC, GG, LP, CS), pp. 137–146.
PLDI-2009-HooimeijerW #constraints #set: A decision procedure for subset constraints over regular languages (PH, WW), pp. 188–198.
ASE-2009-LiXTHS #automation #generative #named #source code #testing #using: Reggae: Automated Test Generation for Programs Using Complex Regular Expressions (NL, TX, NT, JdH, WS), pp. 515–519.
SIGMOD-2008-MajumderRV #data type #scalability: Scalable regular expression matching on data streams (AM, RR, SV), pp. 161–172.
AFL-2008-AfoninK: Semigroups of regular languages over a one letter alphabet are rational (SA, EK), pp. 61–73.
CIAA-2008-ChamparnaudDJ #automaton #geometry #testing: Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
CIAA-2008-GarciaPAR #automaton #finite #learning #nondeterminism #using: Learning Regular Languages Using Nondeterministic Finite Automata (PG, MVdP, GIA, JR), pp. 92–101.
DLT-2008-Ada #communication #complexity #nondeterminism #on the: On the Non-deterministic Communication Complexity of Regular Languages (AA), pp. 96–107.
DLT-2008-GeffertMP #automaton #representation: More Concise Representation of Regular Languages by Automata and Regular Expressions (VG, CM, BP), pp. 359–370.
DLT-2008-GruberH #automaton #finite: Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
DLT-2008-Jiraskova #complexity #on the: On the State Complexity of Complements, Stars, and Reversals of Regular Languages (GJ), pp. 431–442.
DLT-2008-KuskeM #automaton: Construction of Tree Automata from Regular Expressions (DK, IM), pp. 491–503.
ICALP-B-2008-GehrkeGP #equation: Duality and Equational Theory of Regular Languages (MG, SG, JÉP), pp. 246–257.
ICALP-B-2008-GruberH #automaton #finite: Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.
CIKM-2008-GhelliCS #linear: Linear time membership in a class of regular expressions with interleaving and counting (GG, DC, CS), pp. 389–398.
SAC-2008-LoTP #detection #hardware #implementation #network: Hardware implementation for network intrusion detection rules with regular expression support (CTDL, YGT, KP), pp. 1535–1539.
DATE-2008-BonesanaPS #adaptation: An adaptable FPGA-based System for Regular Expression Matching (IB, MP, MDS), pp. 1262–1267.
LCTES-2008-CohenK #named: EventScript: an event-processing language based on regular expressions with actions (NHC, KTK), pp. 111–120.
ESOP-2008-Cheney #query #type system #xml: Regular Expression Subtyping for XML Query and Update Languages (JC), pp. 32–47.
FoSSaCS-2008-GruberJ #bound #communication #complexity #using: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
TACAS-2008-FarzanCCTW #automation #composition #verification: Extending Automated Compositional Verification to the Full Class of ω-Regular Languages (AF, YFC, EMC, YKT, BYW), pp. 2–17.
CIAA-2007-AckermanS #performance: Efficient Enumeration of Regular Languages (MA, JS), pp. 226–242.
ICALP-2007-ArenasBL #automaton #fixpoint #word: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (MA, PB, LL), pp. 888–900.
LATA-2007-HanW: Generalizations of One-Deterministic Regular Languages (YSH, DW), pp. 273–284.
LATA-2007-KutribR #automaton: Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.
LATA-2007-Povarov #complexity: Descriptive Complexity of the Hamming Neighborhood of a Regular Language (GP), pp. 509–520.
IFL-2007-SulzmannL #haskell #named: XHaskell — Adding Regular Expression Types to Haskell (MS, KZML), pp. 75–92.
SAC-2007-LeeHPLJK #performance #using: A high performance NIDS using FPGA-based regular expression matching (JL, SHH, NP, SWL, SJ, YSK), pp. 1187–1191.
FoSSaCS-2007-Rosu #algorithm #effectiveness #problem: An Effective Algorithm for the Membership Problem for Extended Regular Expressions (GR), pp. 332–345.
ITiCSE-2006-Gal-EzerT #algebra #how #question: Algebraic characterization of regular languages: how to cope with all these equivalences? (JGE, MBT), p. 325.
DLT-J-2005-AfoninH06 #problem #set: Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 493–506.
CIAA-2006-PargaGR #algorithm #product line: A Family of Algorithms for Non Deterministic Regular Languages Inference (MVdP, PG, JR), pp. 265–274.
CIAA-2006-Thurston #automaton #parsing: Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression (ADT), pp. 285–286.
DLT-2006-HanSW: Prime Decompositions of Regular Languages (YSH, KS, DW), pp. 145–155.
ICALP-v1-2006-Bille #algorithm: New Algorithms for Regular Expression Matching (PB), pp. 643–654.
DATE-DF-2006-LinHJC #optimisation #pattern matching: Optimization of regular expression pattern matching circuits on FPGA (CHL, CTH, CPJ, SCC), pp. 12–17.
CIAA-J-2004-Yli-Jyra05 #approximate #dependence: Approximating dependency grammars through intersection of star-free regular languages (AYJ), pp. 565–579.
CIAA-2005-HanW #automaton #finite: Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAA-2005-MoraisMR #automaton: Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.
DLT-2005-AfoninH #problem #set: Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 88–99.
DLT-2005-Straubing: Inexpressibility Results for Regular Languages in Nonregular Settings (HS), pp. 69–77.
ICALP-2005-BeaudryLT: Groupoids That Recognize Only Regular Languages (MB, FL, DT), pp. 421–433.
STOC-2005-BojanczykC #automaton: Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.
LICS-2005-BaetenC #algebra #process: Regular Expressions in Process Algebra (JCMB, FC), pp. 12–19.
LICS-2005-BaierG #automaton #probability: Recognizing ω-regular Languages with Probabilistic Automata (CB, MG), pp. 137–146.
SIGITE-2004-AzalovCR #named: ReExpress: a tutor for regular expressions mentoring with technology (PA, MC, RR), p. 268.
CIAA-2004-DelgadoM #approximate: Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
CIAA-2004-FrishertCW #automaton #finite: FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views (MF, LGC, BWW), pp. 125–133.
CIAA-2004-FrishertW #automaton: Combining Regular Expressions with (Near-)Optimal Brzozowski Automata (MF, BWW), pp. 319–320.
CIAA-2004-JirasekJS #complexity: State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
CIAA-2004-LeeS: Enumerating Regular Expressions and Their Languages (JL, JS), pp. 2–22.
CIAA-2004-Yli-Jyra #approximate #dependence: Approximating Dependency Grammars Through Intersection of Regular Languages (AYJ), pp. 281–292.
DLT-2004-AnselmoGM #2d: Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet (MA, DG, MM), pp. 63–75.
ICALP-2004-FrischC: Greedy Regular Expression Matching (AF, LC), pp. 618–629.
ICFP-2004-BrobergFS: Regular expression patterns (NB, AF, JS), pp. 67–78.
ICEIS-v2-2004-HamzaY #constraints #mining #using: Mining Sequential Patterns with Regular Expression Constraints Using Sequential Pattern Tree (MH, KM, MY), pp. 116–121.
WCRE-2003-Latendresse #generative #lightweight #named #robust #semiparsing: RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages (ML), pp. 206–215.
CIAA-2003-FrishertCW #automaton: The Effect of Rewriting Regular Expressions on Their Accepting Automata (MF, LGC, BWW), pp. 304–305.
CIAA-2003-TammU #automaton: Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.
CIAA-2003-Zijl: Succinct Descriptions of Regular Languages with Binary +-NFAs (LvZ), pp. 72–82.
DLT-2003-BonizzoniFMZ #finite #reflexive: Regular Languages Generated by Reflexive Finite Splicing Systems (PB, CdF, GM, RZ), pp. 134–145.
RTA-2003-RouV #incremental #testing: Testing Extended Regular Language Membership Incrementally by Rewriting (GR, MV), pp. 499–514.
VLDB-2002-ChanGR #named #performance: RE-Tree: An Efficient Index Structure for Regular Expressions (CYC, MNG, RR), pp. 263–274.
WCRE-2002-BullTMG #abstraction #relational #semantics: Semantic Grep: Regular Expressions + Relational Abstraction (RIB, AT, AJM, MWG), pp. 267–276.
CIAA-J-2000-Champarnaud02 #automaton #evaluation #nondeterminism: Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions (JMC), pp. 99–113.
CIAA-2002-CampeanuSY: Regex and Extended Regex (CC, KS, SY), pp. 77–84.
DLT-2002-HorvathLL: Roots and Powers of Regular Languages (SH, PL, GL), pp. 220–230.
DLT-2002-Seibert #automaton #finite #performance: Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.
ICALP-2002-Bala: Intersection of Regular Languages and Star Hierarchy (SB), pp. 159–169.
DLT-2001-NiemannW01a: Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.
POPL-2001-HosoyaP #pattern matching #xml: Regular expression pattern matching for XML (HH, BCP), pp. 67–80.
CIAA-2000-Champarnaud #automaton #nondeterminism: Implicit Structures to Implement NFA’s from Regular Expressions (JMC), pp. 80–93.
ICALP-2000-GhicaM #algol #reasoning #using: Reasoning about Idealized ALGOL Using Regular Languages (DRG, GM), pp. 103–115.
ICFP-2000-HosoyaVP #xml: Regular expression types for XML (HH, JV, BCP), pp. 11–22.
PODS-1999-CalvaneseGLV #query: Rewriting of Regular Expressions and Regular Path Queries (DC, GDG, ML, MYV), pp. 194–204.
VLDB-1999-GarofalakisRS #constraints #mining #named: SPIRIT: Sequential Pattern Mining with Regular Expression Constraints (MNG, RR, KS), pp. 223–234.
ICALP-1999-FlescaG #graph #order #query: Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
WIA-1999-NoordG #compilation #finite #natural language: An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing (GvN, DG), pp. 122–139.
PODS-1998-FlorescuLS #query: Query Containment for Conjunctive Queries with Regular Expressions (DF, AYL, DS), pp. 139–148.
DLT-1997-Moshkov #complexity #nondeterminism #recognition #word: Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.
WIA-1997-Caron #automaton #named: LANGAGE: A Maple Package for Automaton Characterization of Regular Languages (PC), pp. 46–55.
WIA-1997-Ponty #performance: An Efficient Null-Free Procedure for Deciding Regular Language Membership (JLP), pp. 159–170.
WIA-1997-SalomaaWY #implementation #performance #using: Efficient Implementation of Regular Languages Using R-AFA (KS, XW, SY), pp. 176–184.
CIKM-1997-NakayamaYK #constraints: I-Regular Expression: Regular Expression with Continuous Interval Constraints (KN, KY, SK), pp. 40–50.
CAV-1997-Fisler #decidability #diagrams: Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable (KF), pp. 155–166.
ICALP-1996-Raymond #data flow #network: Recognizing Regular Expressions by Means of Dataflow Networks (PR), pp. 336–347.
WIA-1996-PontyZC #algorithm #automaton #polynomial: A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.
ICML-1996-Bostrom #induction #logic programming #source code: Theory-Guideed Induction of Logic Programs by Inference of Regular Languages (HB), pp. 46–53.
ICPR-1996-AlquezarS #context-sensitive grammar #learning: Learning of context-sensitive languages described by augmented regular expressions (RA, AS), pp. 745–749.
TAPSOFT-1995-WilkeY #infinity #polynomial #word: Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time (TW, HY), pp. 288–302.
DLT-1993-AntimirovM: Rewriting Extended Regular Expressions (VMA, PDM), pp. 195–209.
CAV-1992-HojatiTKB #performance: Efficient ω-Regular Language Containment (RH, HJT, RPK, RKB), pp. 396–409.
ICALP-1991-Hashiguchi #algorithm #generative: Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
ICALP-1991-KanepsF #automaton #probability: Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata (JK, RF), pp. 174–185.
ICALP-1989-Baeza-YatesG #performance: Efficient Text Searching of Regular Expressions (RABY, GHG), pp. 46–62.
ICALP-1988-StraubingTT #quantifier: regular Languages Defined with Generalized Quantifiers (HS, DT, WT), pp. 561–575.
RTA-1987-Benois #algorithm #automaton #complexity #term rewriting: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
ICALP-1985-Kortelainen #commutative: Every Commutative Quasirational Language is Regular (JK), pp. 348–355.
RTA-1985-Zaionc #set #λ-calculus: The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.
ICALP-1984-IzumiIH #algebra #axiom: A Complete Axiom System for Algebra of Closed-Regular Expression (HI, YI, NH), pp. 260–269.
POPL-1983-Wegman #graph: Summarizing Graphs by Regular Expressions (MNW), pp. 203–216.
ICALP-1981-Reutenauer: A New Characterization of the Regular Languages (CR), pp. 177–183.
ICALP-1980-Furer #complexity #problem: The Complexity of the Inequivalence Problem for Regular Expressions with Intersection (MF), pp. 234–245.
STOC-1974-EhrenfeuchtZ #complexity #metric: Complexity Measures for Regular Expressions (AE, HPZ), pp. 75–79.
ICALP-1972-Linna #finite: Finite Power Property of Regular Languages (ML), pp. 87–98.
STOC-1969-Johansen: Free Groups and Regular Expressions (PJ), pp. 113–128.