Boundedness problems for Minsky counter machines

DOI10.1134/S0361768810010020zbMath1204.68122OpenAlexW1964889605WikidataQ57758826 ScholiaQ57758826MaRDI QIDQ5917948

V. A. Sokolov, E. V. Kuzmin, D. Ju. Chalyy

Publication date: 24 September 2010

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768810010020

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ LTL-Specification of Bounded Counter Machines ⋮ LTL-Specification of Counter Machines

Cites Work

• Unnamed Item
• Unnamed Item
• Grammatical Inference: Algorithms and Applications
• Term Rewriting and Applications