Semilinear sets and counter machines: a brief survey

DOI10.3233/FI-2015-1198MaRDI QIDQ2805446zbMATH OpenFDO

Authors Oscar H. Ibarra, Shinnosuke Seki

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

descriptional complexityclosure propertylinear Diophantine equationsParikh's theoremsemilinear setdecidablereversal-bounded counter machineundecidable

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4097336
• On bounded semilinear languages, counter machines, and finite-index ET0L
• Implementation and Application of Automata
• The semilattice of computable families of recursively enumerable sets
• scientific article; zbMATH DE number 24993
• On the descriptional complexity of operations on semilinear sets
• scientific article; zbMATH DE number 4172404
• Counting Complexity Classes for Numeric Computations I: Semilinear Sets
• Semirecursive Sets and Positive Reducibility

Cited in

(7)

• scientific article; zbMATH DE number 4172404 (Why is no real title available?)
• scientific article; zbMATH DE number 7444014 (Why is no real title available?)
• The taming of the semi-linear set
• On the boundedness property of semilinear sets
• Learning semilinear sets from examples and via queries
• On the descriptional complexity of operations on semilinear sets
• Implementation and Application of Automata

This page was built for publication: Semilinear sets and counter machines: a brief survey

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