scientific article; zbMATH DE number 7204569
From MaRDI portal
Publication:5111449
DOI10.4230/LIPIcs.ICALP.2017.117zbMath1442.68088arXiv1612.06233MaRDI QIDQ5111449
Lorenzo Clemente, Charles Paperman, Wojciech Czerwiński, Sławomir Lasota
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1612.06233
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitydecidabilityParikh automataregular separability probleminteger vector addition systemsvisible one-counter automata
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Unnamed Item ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Unnamed Item ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Unnamed Item ⋮ Learning algorithms
This page was built for publication:
