Results 51 to 60 of about 4,664,026 (360)
Demonstratio Mathematica, 2004 Summary: This paper reviews and extends the recent work on signed real measure of regular languages within a unified framework. The language measure provides total ordering of partially ordered sets of sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different ...
Surana, Amit, Ray, Asok
openaire +2 more sources
Regular component decomposition of regular languages
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Using Data Mining Algorithms to Discover Regular Sound Changes among Languages [PDF]
MATEC Web of Conferences, 2019 This paper presents a method of using association rule data mining algorithms to discover regular sound changes among languages. The method presented has a great potential to facilitate linguistic studies aimed at identifying distantly related cognate ...
Revesz Peter Z.
doaj +1 more source
Efficient Separability of Regular Languages by Subsequences and Suffixes [PDF]
International Colloquium on Automata, Languages and Programming, 2013 When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof.
Wojciech Czerwinski +2 more
semanticscholar +1 more source
Non-Deterministic Kleene Coalgebras [PDF]
Logical Methods in Computer Science, 2010 In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva +2 more
doaj +1 more source
One-Unambiguous Regular Languages
Information and Computation, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruggemann-Klein, Anne, Wood, Derick
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
Regular Separability of One Counter Automata [PDF]
Logical Methods in Computer Science, 2019 The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other.
Wojciech Czerwiński, Sławomir Lasota
doaj +1 more source
Quotient Complexities of Atoms of Regular Languages
, 2012 An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection.
Brzozowski, Janusz, Tamm, Hellis
core +1 more source
Quotient Complexities of Atoms in Regular Ideal Languages [PDF]
, 2015 A (left) quotient of a language $L$ by a word $w$ is the language $w^{-1}L=\{x\mid wx\in L\}$. The quotient complexity of a regular language $L$ is the number of quotients of $L$; it is equal to the state complexity of $L$, which is the number of states ...
Brzozowski, Janusz, Davies, Sylvie
core +4 more sources