Results 11 to 20 of about 7,225,806 (376)
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
+11 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
Regular Expressions with Lookahead [PDF]
JUCS - Journal of Universal Computer Science, 2021 This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having at most 3 states more than the length of the REwLA.
Berglund,Martin +2 more
openaire +5 more sources
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
Regular transducer expressions for regular transformations [PDF]
Information and Computation, 2018 Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on infinite words, captured by a deterministic two-way transducer, can be described with a regular transducer expression ...
Shankara Narayanan Krishna +2 more
openaire +4 more sources
Implication of regular expressions
Applied Mathematics Letters, 2011 AbstractIn this work we study the following implication problem for regular expressions: “Given a set of regular expressions R and a regular expression S, is it true that every string which matches the regular expressions in R also matches S?” The problem comes in two flavors: “non-disjoint” and “disjoint”. We show that both of them are PSPACE-complete.
Alex Thomo
openalex +3 more sources
The inclusion problem for regular expressions [PDF]
Journal of Computer and System Sciences, 2011 AbstractThis paper presents a polynomial-time algorithm for the inclusion problem for a large class of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the lower bound implied by the Myhill–Nerode theorem.
Dag Hovland
openalex +8 more sources
Scientific reference style using rule-based machine learning
IJAIN (International Journal of Advances in Intelligent Informatics), 2023 Regular Expressions (RegEx) can be employed as a technique for supervised learning to define and search for specific patterns inside text. This work devised a method that utilizes regular expressions to convert the reference style of academic papers into
Afrida Helen +2 more
doaj +1 more source
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Maejo International Journal of Science and Technology, 2013 Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source
The use of syntax trees in order to automate the correction of LaTeX documents [PDF]
Компьютерные исследования и моделирование, 2012 The problem is to automate the correction of LaTeX documents. Each document is represented as a parse tree. The modified Zhang-Shasha algorithm is used to construct a mapping of tree vertices of the original document to the tree vertices of the edited ...
Kirill Vladimirovich Chuvilin
doaj +1 more source