Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6997829> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Q6997829 subject Q5915288.
- Q6997829 subject Q7036095.
- Q6997829 subject Q7142640.
- Q6997829 abstract "In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of ordered unranked trees, as traditionally used for modelling hierarchical structures. Finite-state acceptors for nested words,so-called nested word automata, then give a more expressive generalization of finite automata on words. The linear encodings of languages accepted by finite nested word automata gives the class of visibly pushdown languages. The latter language class lies properly between the regular languages and the deterministic context-free languages. Since their introduction in 2004, these concepts have triggered much research in that area.".
- Q6997829 wikiPageExternalLink OperPrecAndVPpropWithApp.pdf.
- Q6997829 wikiPageExternalLink vpl.
- Q6997829 wikiPageExternalLink linconj_vs_dcfl.pdf.
- Q6997829 wikiPageExternalLink nw.html.
- Q6997829 wikiPageExternalLink vpa.
- Q6997829 wikiPageWikiLink Q126002.
- Q6997829 wikiPageWikiLink Q1276570.
- Q6997829 wikiPageWikiLink Q1569697.
- Q6997829 wikiPageWikiLink Q184754.
- Q6997829 wikiPageWikiLink Q190913.
- Q6997829 wikiPageWikiLink Q192161.
- Q6997829 wikiPageWikiLink Q21198.
- Q6997829 wikiPageWikiLink Q21199.
- Q6997829 wikiPageWikiLink Q214526.
- Q6997829 wikiPageWikiLink Q223655.
- Q6997829 wikiPageWikiLink Q338047.
- Q6997829 wikiPageWikiLink Q369377.
- Q6997829 wikiPageWikiLink Q378713.
- Q6997829 wikiPageWikiLink Q4054157.
- Q6997829 wikiPageWikiLink Q450569.
- Q6997829 wikiPageWikiLink Q4973304.
- Q6997829 wikiPageWikiLink Q5161176.
- Q6997829 wikiPageWikiLink Q5915288.
- Q6997829 wikiPageWikiLink Q600590.
- Q6997829 wikiPageWikiLink Q617295.
- Q6997829 wikiPageWikiLink Q6897882.
- Q6997829 wikiPageWikiLink Q7036095.
- Q6997829 wikiPageWikiLink Q7097825.
- Q6997829 wikiPageWikiLink Q7142640.
- Q6997829 wikiPageWikiLink Q7285926.
- Q6997829 wikiPageWikiLink Q7392162.
- Q6997829 wikiPageWikiLink Q751443.
- Q6997829 wikiPageWikiLink Q752532.
- Q6997829 wikiPageWikiLink Q7623989.
- Q6997829 wikiPageWikiLink Q837479.
- Q6997829 wikiPageWikiLink Q837518.
- Q6997829 wikiPageWikiLink Q837528.
- Q6997829 wikiPageWikiLink Q849775.
- Q6997829 comment "In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of ordered unranked trees, as traditionally used for modelling hierarchical structures. Finite-state acceptors for nested words,so-called nested word automata, then give a more expressive generalization of finite automata on words.".
- Q6997829 label "Nested word".