scientific article; zbMATH DE number 7315090

MaRDI QIDQ4964009zbMATH OpenFDO

Authors Émilie Charlier, Narad Rampersad, Laurent Waxweiler, Michel Rigo

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1008.1668, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2010.7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The complexity of divisibility
• State complexity and approximation
• scientific article; zbMATH DE number 7301304
• On the complexity of linear arithmetic with divisibility
• State complexity research and approximation
• The complexity of Boolean state separation
• Finite state complexity
• scientific article; zbMATH DE number 7453075
• Publication:3203065
• State complexity of unique rational operations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964009)