Affine Parikh automata

DOI10.1051/ita/2012013zbMath1279.68136OpenAlexW2142452201MaRDI QIDQ4649455

Michaël Cadilhac, Pierre McKenzie, Alain Finkel

Publication date: 22 November 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2012013

zbMATH Keywords

automatacounter machinessemilinear setsaffine functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The effect of end-markers on counter machines and commutativity, On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\), Synchronization of Parikh automata, Jumping automata over Infinite words, Unboundedness problems for machines with reversal-bounded counters, Input-Position-Restricted Models of Language Acceptors, ``Most of leads to undecidability: failure of adding frequencies to LTL, The algebraic theory of Parikh automata, On a class of languages with holonomic generating functions, Unnamed Item