Results 61 to 70 of about 81,118 (297)
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity.
Jos C. M. Baeten +3 more
doaj +1 more source
ALSIC: Apprentissage des Langues et Systèmes d'Information et de Communication, 2023 The present paper describes an applied linguistics experiment aiming to evaluate the appropriateness of regular expressions (regex) to improve foreign language students' ability to identify the relationship between the graphic (letters) and phonic ...
Jacopo Saturno
doaj +1 more source
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences, 2005 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 efficiently minimize a given nfa or regular expression with n states, transitions, respectively ...
Gregor Gramlich, Georg Schnitger
openaire +1 more source
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower
Hermann Gruber, Markus Holzer
doaj +1 more source
The inclusion problem for regular expressions [PDF]
Journal of Computer and System Sciences, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +6 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
WebCollectives: A light regular expression based web content extractor in Java
SoftwareX, 2023 Conventional web crawling methods typically involve a sequence of distinct steps for downloading and extracting web content. A noteworthy limitation of these conventional crawling approaches is their lack of a focus-based crawling strategy.
Hayri Volkan Agun
doaj +1 more source
Regular Expression Based Medical Text Classification Using Constructive Heuristic Approach
IEEE Access, 2019 Medical text classification assigns medical related text into different categories such as topics or disease types. Machine learning based techniques have been widely used to perform such tasks despite the obvious drawback in such “black box ...
Menglin Cui +5 more
doaj +1 more source