Results 31 to 40 of about 25,771 (294)
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 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
A decidable characterization of locally testable tree languages [PDF]
Logical Methods in Computer Science, 2011 A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree.
Thomas Place, Luc Segoufin
doaj +1 more source
Temporal Logic and Model Checking for Operator Precedence Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 In the last decades much research effort has been devoted to extending the success of model checking from the traditional field of finite state machines and various versions of temporal logics to suitable subclasses of context-free languages and ...
Michele Chiari +2 more
doaj +1 more source
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is analytic-complete as a set in Cantor space.
Szczepan Hummel
doaj +1 more source
On the Accuracy of Language Trees
PLoS ONE, 2011 Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available information are typically lists of homologous (lexical, phonological, syntactic) features or characters for many different languages.
Simone Pompei +2 more
openaire +6 more sources
On the Separation Question for Tree Languages [PDF]
Theory of Computing Systems, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnold, André +2 more
openaire +5 more sources
Finite Automata with Generalized Acceptance Criteria [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a condition on the sequence of leaves in the automaton's computation tree.
Timo Peichl, Heribert Vollmer
doaj +3 more sources
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 +4 more sources
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
Logical Methods in Computer Science, 2019 In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source