BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
tree (11)
automata (5)
logic (4)
unord (2)
queri (2)

Stem unrank$ (all stems)

11 papers:

AFLAFL-2011-PiaoSV #morphism
Tree Homomorphisms for Unranked Trees (XP, KS, SV), pp. 343–357.
LICSLICS-2011-GoncharovS #monad
Powermonads and Tensors of Unranked Effects (SG, LS), pp. 227–236.
RTARTA-2011-KutsiaLV
Anti-Unification for Unranked Terms and Hedges (TK, JL, MV), pp. 219–234.
CIAACIAA-2008-Fujiyoshi #automaton #context-free grammar
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.
DLTDLT-2007-Priese #automaton #finite #graph
Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.
ICALPICALP-2007-KariantoL #automaton
Unranked Tree Automata with Sibling Equalities and Disequalities (KW, CL), pp. 875–887.
ICALPICALP-2005-Libkin #bibliography #logic #perspective
Logics for Unranked Trees: An Overview (LL), pp. 35–50.
LICSLICS-2005-BarceloL #logic
Temporal Logics over Unranked Trees (PB, LL), pp. 31–40.
RTARTA-2005-BonevaT #automaton #logic
Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.
RTARTA-2004-CarmeNT #automaton #query
Querying Unranked Trees with Stepwise Tree Automata (JC, JN, MT), pp. 105–118.
LICSLICS-2003-LibkinN #logic #query
Logical Definability and Query Languages over Unranked Trees (LL, FN), pp. 178–187.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.