Login / Signup

Some complete ømega-powers of a one-counter language, for any Borel class of finite rank.

Olivier FinkelDominique Lecomte
Published in: Arch. Math. Log. (2021)
Keyphrases
  • programming language
  • natural language
  • language learning
  • finite number
  • rank aggregation
  • high level