Results 41 to 50 of about 1,782,235 (292)
A Robust Class of Context-Sensitive Languages
, 2007 We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations.
Torre, Salvatore La +2 more
core +2 more sources
On Learning Nominal Automata with Binders [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate a learning algorithm in the context of nominal automata, an extension of classical automata to alphabets featuring names. This class of automata captures nominal regular languages; analogously to the classical language theory, nominal ...
Yi Xiao, Emilio Tuosto
doaj +1 more source
The genus of regular languages [PDF]
Mathematical Structures in Computer Science, 2016 The paper defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, an FSA can be seen as a graph for which the notion of genus arises. At the same time, an FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus.
Bonfante, Guillaume, Deloup, Florian
openaire +4 more sources
Count-based state merging for probabilistic regular tree grammars [PDF]
, 2015 We present an approach to obtain language models from a tree corpus using probabilistic regular tree grammars (prtg). Starting with a prtg only generating trees from the corpus, the prtg is generalized step by step by merging nonterminals.
Dietze, Toni, Nederhof, Mark Jan
core +2 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
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
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Shwachman–Diamond syndrome (SDS) is a rare autosomal recessive ribosomopathy characterized by bone marrow failure and multisystem involvement, with emerging evidence of associated neurocognitive impairment. Methods We conducted a retrospective study of 240 individuals with biallelic Shwachman–Bodian–Diamond syndrome (SBDS) mutations
Jane Koo +11 more
wiley +1 more source
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
Regular Languages of Thin Trees [PDF]
Theory of Computing Systems, 2015 For a fixed alphabet \(A\), a \textit{forest} is a ``mapping from its set of nodes \(\mathrm{dom}(t)\subset\omega^+\) into \(A\)''. It is additionally assumed that ``a forest is finitely branching: for every \(w\in\omega^\ast\) there are only finitely many nodes of the form \(wn\) for \(n\in {\mathbb N}\) in \(\mathrm{dom}(t)\)''; these nodes (of the ...
Bojanczyk, Mikolaj +2 more
openaire +5 more sources