Comparing consecutive letter counts in multiple context-free languages

19 Feb 2020 Florian Lehner Christian Lindorfer

Context-free grammars are not able to model cross-serial dependencies in natural languages. To overcome this issue, Seki et al. introduced a generalization called $m$-multiple context-free grammars ($m$-MCFGs), which deal with $m$-tuples of strings... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • FORMAL LANGUAGES AND AUTOMATA THEORY
  • COMBINATORICS
  • 68Q45