The algebraic theory of Parikh automata
type: Item
instance of: scholarly article
title: The algebraic theory of Parikh automata
zbMATH Open document ID: 1410.68244
author: Michaël Cadilhac
author: A. Krebs
author: Pierre McKenzie
published in: Theory of Computing Systems
publication date: 2018-07-23T00:00:00Z
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 6909390
zbMATH Keywords: automata
zbMATH Keywords: semilinear sets
zbMATH Keywords: monoids
zbMATH Keywords: typed monoids
zbMATH Keywords: circuits
describes a project that uses: MathOverflow
MaRDI profile type: Publication
full work available at URL: s00224-017-9817-2
OpenAlex ID: W2767333777
cites work: Q5275367
cites work: Q4601857
cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
cites work: Finite monoids and the fine structure of NC 1
cites work: Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
cites work: Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
cites work: Q3653240
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Affine Parikh automata
cites work: Bounded Parikh automata
cites work: UNAMBIGUOUS CONSTRAINED AUTOMATA
cites work: Nondeterministic \(NC^1\) computation
cites work: Q4132170
cites work: Q4052071
cites work: Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
cites work: Bounded Regular Sets
cites work: Semigroups, Presburger formulas, and languages
cites work: Kleene, Rabin, and Scott Are Available
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Formal Languages and Groups as Memory
cites work: Q4449212
cites work: Characterizing \(\text{TC}^{0}\) in terms of infinite groups
cites work: On Context-Free Languages
cites work: Q4155837
cites work: Q4302435
cites work: Some closure properties of the family of stochastic languages
DOI: 10.1007/S00224-017-9817-2
description: scientific article; zbMATH DE number 6909390