go-v.orgcodex
Menu
Page tools

codex · Philosophy

Nested word

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.

Wikipedia contributors, "Nested word", Wikipedia, revision 1383246704, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex