Results 81 to 90 of about 697,927 (279)
Theoretical Computer Science, 1988 AbstractThis paper is a continuation of [3]. It gives some further properties of limited regular languages and partial solutions to two of S. Eilenberg's open problems [2, p. 158].
Chang-jie Tang, Yi-li Zhang
openaire +2 more sources
The dissecting power of regular languages [PDF]
Information Processing Letters, 2013 A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they need to cut numerous infinite languages.
Tomoyuki Yamakami, Yuichi Kato
openaire +2 more sources
FEBS Open Bio, EarlyView.This study investigated a novel WST‐8‐based assay for evaluating d‐Amino acid oxidase (DAO) inhibitors. We confirmed its effectiveness using known inhibitors and found that uremic toxins possess relatively weak inhibitory activity compared to existing drugs.
Kahoko Miyake +4 more
wiley +1 more source
Deciding the Borel complexity of regular tree languages
, 2014 We show that it is decidable whether a given a regular tree language belongs to the class ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.Comment: 15 pages, 2 ...
A. Blumensath +8 more
core +1 more source
Regular language quantum states [PDF]
QuantumWe introduce regular language states, a family of quantum many-body states. They are built from a special class of formal languages, called regular, which has been thoroughly studied in the field of computer science.
Marta Florido-Llinàs +3 more
doaj +1 more source
Maximally Atomic Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known.
Janusz Brzozowski, Gareth Davies
doaj +1 more source
Regular realizability problems and regular languages
CoRR, 2015 We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language called filter is non-empty. We consider two kind of problems depending on representation of regular language. If a regular language on input is represented by a DFA, then we
openaire +2 more sources
FEBS Open Bio, EarlyView.Bisphenol A (BPA), a common chemical in plastics, exerts dual effects on bladder cancer cells: low doses promote growth and migration, while high doses suppress growth and migration. Multi‐omics and bioinformatics reveal BPA acts via MAPK and inflammatory pathways.
Shaomin Niu +10 more
wiley +1 more source
Generative Power and Closure Properties of Watson-Crick Grammars
Applied Computational Intelligence and Soft Computing, 2016 We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties.
Nurul Liyana Mohamad Zulkufli +3 more
doaj +1 more source
Parameterized regular expressions and their languages
Theoretical Computer Science, 2013 We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly ...
Pablo Barceló +2 more
openaire +9 more sources