Approximate NFA universality motivated by information theory

DOI10.1007/978-3-031-13257-5_11OpenAlexW4300180518MaRDI QIDQ2112188

Nelma Moreira, Mitja Mastnak, Rogério Reis, Stavros Konstantinidis

Publication date: 18 January 2023

Full work available at URL: https://arxiv.org/abs/2202.01594

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Approximate NFA universality and related problems motivated by information theory

Cites Work

• Probability, information theory, and prime number theory
• Problems on finite automata and the exponential time hypothesis
• A class of probability distributions on the integers
• FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION
• COMPLEXITY, INFORMATION, ENERGY
• Randomized generation of error control codes with automata and transducers
• Computational Complexity
• Computational Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate NFA universality motivated by information theory