Results 21 to 30 of about 19,622 (256)
Tree algebra of sofic tree languages [PDF]
RAIRO - Theoretical Informatics and Applications, 2014 We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of sub-shifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of ...
Aubrun, Nathalie, Béal, Marie-Pierre
openaire +2 more sources
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
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
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
Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007), 2007 sponsorship ...
openaire +2 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
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
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
Analyzing Indo-European Language Similarities Using Document Vectors
Informatics, 2023 The evaluation of similarities between natural languages often relies on prior knowledge of the languages being studied. We describe three methods for building phylogenetic trees and clustering languages without the use of language-specific information ...
Samuel R. Schrader, Eren Gultepe
doaj +1 more source
Restrictions on tree adjoining languages [PDF]
Proceedings of the 17th international conference on Computational linguistics -, 1998 7 pages LaTeX + 5 eps ...
SATTA, GIORGIO, SCHULER W.
openaire +4 more sources