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 a words, as traditionally used for modeling linearly ordered structures, and of ordered unranked trees, as traditionally used for modeling hierarchical structures. Finite-state acceptors for nested words, so-called nested word automata, then give a more expressive generalization of finite automata on words.
| Property | Value |
|---|
| dbpprop: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 a words, as traditionally used for modeling linearly ordered structures, and of ordered unranked trees, as traditionally used for modeling 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 a lot of research in that area.
|
| dbpprop:reference
| |
| rdfs: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 a words, as traditionally used for modeling linearly ordered structures, and of ordered unranked trees, as traditionally used for modeling hierarchical structures. Finite-state acceptors for nested words, so-called nested word automata, then give a more expressive generalization of finite automata on words.
|
| rdfs:label
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
