Lower bounds for the state complexity of probabilistic languages and the language of prime numbers

DOI10.1093/logcom/exaa007OpenAlexW3007499230WikidataQ126410813 ScholiaQ126410813MaRDI QIDQ5108020

Nathanaël Fijalkow

Publication date: 29 April 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

automatastate complexityprime numberscomplexity theoryprobabilistic languagesalternating automata

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

This page was built for publication: Lower bounds for the state complexity of probabilistic languages and the language of prime numbers