Results 11 to 20 of about 889,414 (343)
Games for Succinctness of Regular Expressions [PDF]
EPTCS 346, 2021, pp. 258-272, 2021 We present a version of so called formula size games for regular expressions. These games characterize the equivalence of languages up to expressions of a given size. We use the regular expression size game to give a simple proof of a known non-elementary succinctness gap between first-order logic and regular expressions.
arxiv +7 more sources
Understanding Regular Expressions
The Programming Historian, 2013 In this exercise we will use advanced find-and-replace capabilities in a word processing application in order to make use of structure in a brief historical document that is essentially a table in the form of prose.
Doug Knox
doaj +3 more sources
Minimizing nfa's and regular expressions [PDF]
Journal of Computer and System Sciences, 2007 We show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as of regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's).We show that it is impossible to
Gramlich, Gregor, Schnitger, Georg
core +4 more sources
Derivatives for Enhanced Regular Expressions [PDF]
arXiv, 2016 Regular languages are closed under a wealth of formal language operators. Incorporating such operators in regular expressions leads to concise language specifications, but the transformation of such enhanced regular expressions to finite automata becomes more involved.
arxiv +6 more sources
Regular expression types for XML [PDF]
Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, 2000 We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in XML documents using regular expression operators (i.e., *, ?, |, etc.) and supporting a simple but powerful notion of
Haruo Hosoya +2 more
+12 more sources
Regular expression patterns [PDF]
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, 2004 We extend Haskell with regular expression patterns . Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as found in Haskell. It has proven useful for string manipulation and for processing structured data such as XML.
Niklas Broberg +2 more
openalex +3 more sources
Testing Tool for Information Visualizations based on User Interactions
Journal of Computer Science and Technology, 2022 Decision-making has become a vital tool in any organization, evolving from a process based on experience and intuition to one increasingly established in data analysis.
Martin Larrea +3 more
doaj +1 more source
Synchronized Regular Expressions [PDF]
Electronic Notes in Theoretical Computer Science, 2002 Abstract Text manipulation is one of the most common tasks for everyone using a computer. The increasing number of textual information in electronic format that every computer user collects everyday stresses the need of more powerful tools to interact with texts.
DELLA PENNA, GIUSEPPE +3 more
openaire +5 more sources
Derivatives of approximate regular expressions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and Semantics Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions ...
Jean-Marc Champarnaud +2 more
openalex +11 more sources
Automated extraction of ejection fraction for quality measurement using regular expressions in Unstructured Information Management Architecture (UIMA) for heart failure. [PDF]
J Am Med Inform Assoc, 2012 Garvin JH +11 more
europepmc +3 more sources