On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
Emmanuel ArrighiHenning FernauStefan HoffmannMarkus HolzerIsmaël JeckerMateus de Oliveira OliveiraPetra WolfPublished in: FSTTCS (2021)
Keyphrases
- tractable cases
- programming language
- general purpose
- intrinsic complexity
- natural language
- computational cost
- complexity measures
- regular languages
- artificial intelligence
- information systems
- language learning
- decision problems
- machine learning
- learning algorithm
- specification language
- object oriented programming
- language processing
- space complexity
- real time
- worst case
- natural language processing
- multi agent systems
- case study