Regular separability of Parikh automata

DOI10.4230/LIPICS.ICALP.2017.117zbMATH Open1442.68088arXiv1612.06233MaRDI QIDQ5111449FDOQ5111449

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

Recommendations

• Regular separability of one counter automata
• Regular separability of one counter automata
• Efficient separability of regular languages by subsequences and suffixes
• Separating regular languages by piecewise testable and unambiguous languages
• Separating regular languages with first-order logic

zbMATH Keywords

decidabilityundecidabilityParikh automataregular separability probleminteger vector addition systemsvisible one-counter automata

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unboundedness Problems for Languages of Vector Addition Systems.
• Unboundedness problems for machines with reversal-bounded counters
• Bounded Parikh automata
• Title not available (Why is that?)
• Learning algorithms

This page was built for publication: Regular separability of Parikh automata

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