Everything About ___
Live briefing

Everything about Nested word

Formal language concept

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 →

🧭 Start here: a 6-step reading path

  1. Read the overview: Nested wordA 5-minute orientation
  2. Skim a recent paper: Decoupled Attention and Character–Word Mask for Chinese Nested Named Entity RecognitionInfluential work since 2022
  3. Pick up a classic book: Fat Cat on a MatThe most-reprinted book on the subject
  4. Read the landmark paper: Operational state complexity of nested word automataCited 24 times
  5. Go sideways: Deterministic pushdown automatonA closely related topic
  6. Go sideways: Pushdown automatonA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Formal definition
  2. Encoding nested words into ordinary words
  3. Automata
  4. Decision problems
  5. Languages
  6. Other models of description

🏆 Landmark papers (most cited)

🆕 Influential since 2022

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics