Results 41 to 50 of about 697,927 (279)
On the Problem of Computing the Probability of Regular Sets of Trees [PDF]
, 2015 We consider the problem of computing the probability of regular languages of infinite trees with respect to the natural coin-flipping measure. We propose an algorithm which computes the probability of languages recognizable by \emph{game automata}.
Michalewski, Henryk, Mio, Matteo
core +5 more sources
Power of Randomization in Automata on Infinite Strings [PDF]
Logical Methods in Computer Science, 2011 Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined.
Rohit Chadha +2 more
doaj +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
Query learning of derived $\omega$-tree languages in polynomial time [PDF]
Logical Methods in Computer Science, 2019 We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\omega ...
Dana Angluin +2 more
doaj +1 more source
Efficient Algorithms for Morphisms over Omega-Regular Languages [PDF]
, 2015 Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a ...
Fleischer, Lukas, Kufleitner, Manfred
core +3 more sources
Families of DFAs as Acceptors of $\omega$-Regular Languages [PDF]
Logical Methods in Computer Science, 2018 Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the ...
Dana Angluin, Udi Boker, Dana Fisman
doaj +1 more source
Syntactic structures of regular languages [PDF]
Theoretical Computer Science, 2019 We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.
Ondrej Klíma 0001, Libor Polák
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Central nervous system (CNS) involvement in childhood acute lymphoblastic leukemia (ALL) is assessed by cell counting and cytomorphology from cerebrospinal fluid (CSF) and is used for treatment stratification worldwide. The ratio of “CNS2” patients in clinical trials ranges from 3% to 40%, with unclear prognostic significance ...
Laura Almási +14 more
wiley +1 more source
Regular Languages in the Sliding Window Model [PDF]
TheoretiCSWe study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$.
Moses Ganardi +4 more
doaj +1 more source
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