Implementation and Application of Automata, 2016, p.322-334
2016
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
- Ist Teil von
- Implementation and Application of Automata, 2016, p.322-334
- Ort / Verlag
- Cham: Springer International Publishing
- Erscheinungsjahr
- 2016
- Quelle
- Alma/SFX Local Collection
- Beschreibungen/Notizen
- We apply results from ambiguity of non-deterministic finite automata to the problem of determining the asymptotic worst-case matching time, as a function of the length of the input strings, when attempting to match input strings with a given regular expression, where the matcher being used is a backtracking regular expression matcher.
- Sprache
- Englisch
- Identifikatoren
- ISBN: 331940945X, 9783319409450, 3319409468, 9783319409467ISSN: 0302-9743eISSN: 1611-3349DOI: 10.1007/978-3-319-40946-7_27Titel-ID: cdi_swepub_primary_oai_DiVA_org_umu_130123
- Format
- –
- Schlagworte
- Ambiguity, Backtracking matcher, Regular expression