Login / Signup
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language.
Olivier Finkel
Published in:
Int. J. Found. Comput. Sci. (2012)
Keyphrases
</>
regular languages
language learning
programming language
intended meaning
conceptual graphs
point correspondences
wide range
artificial intelligence
description logics
real numbers
machine learning
natural language
image sequences
modeling language
language processing
computational linguistics
specification language
neural network