Semilinear sets and counter machines: a brief survey

DOI10.3233/FI-2015-1198zbMATH Open1335.68124MaRDI QIDQ2805446FDOQ2805446

Authors: Oscar H. Ibarra, Shinnosuke Seki 

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Learning semilinear sets from examples and via queries
• Title not available (Why is that?)
• Implementation and Application of Automata
• Title not available (Why is that?)

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)