Results 31 to 40 of about 5,692,247 (342)
Synchronized Regular Expressions [PDF]
Electronic Notes in Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DELLA PENNA, GIUSEPPE +3 more
openaire +5 more sources
Ensuring the Correctness of Regular Expressions: A Review
International Journal of Automation and Computing, 2021 Regular expressions are widely used within and even outside of computer science due to their expressiveness and flexibility. However, regular expressions have a quite compact and rather tolerant syntax that makes them hard to understand, hard to compose,
Lixiao Zheng +3 more
semanticscholar +1 more source
FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions [PDF]
International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2020 Form validators based on regular expressions are often used on digital forms to prevent users from inserting data in the wrong format. However, writing these validators can pose a challenge to some users.
Margarida Ferreira +4 more
semanticscholar +1 more source
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
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
Generation of regular expressions for automata by the integral of regular expressions [PDF]
The Computer Journal, 1972 In this paper, the integral of regular expressions is defined and its properties are presented— The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table.
Stephen S. Yau, L. W. Smith
openaire +3 more sources
Text Indexing for Regular Expression Matching
Algorithms, 2021 Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than O(|T||p|) has been found.
Daniel Gibney, Sharma V. Thankachan
doaj +1 more source
Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strict unboundedness), and ωBS-regular ...
Dario Della Monica +2 more
doaj +1 more source
Efficient Construction of the Equation Automaton
Algorithms, 2021 This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression.
Faissal Ouardi +2 more
doaj +1 more source
Multi-modal synthesis of regular expressions [PDF]
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2019 In this paper, we propose a multi-modal synthesis technique for automatically constructing regular expressions (regexes) from a combination of examples and natural language.
Qiaochu Chen +4 more
semanticscholar +1 more source