@article{Cadilhac2018,
    Abstract = {The Parikh automaton model equips a finite automaton with integer registers and imposes a semilinear constraint on the set of their final settings. Here the theories of typed monoids and of rational series are used to characterize the language classes that arise algebraically. Complexity bounds are derived, such as containment of the unambiguous Parikh automata languages in NC1. Affine Parikh automata, where each transition applies an affine transformation on the registers, are also considered. Relying on these characterizations, the landscape of relationships and closure properties of the classes at hand is completed, in particular over unary languages.},
    Author = {Cadilhac, Micha{\"e}l and Krebs, Andreas and McKenzie, Pierre},
    File = {Cadilhac2018\_Article\_TheAlgebraicTheoryOfParikhAuto (0) - a - a - z.pdf},
    ISSN = {1433-0490},
    Journal = {Theory of Computing Systems},
    Month = {Jul},
    Number = {5},
    Pages = {1241--1268},
    Title = {The Algebraic Theory of {Parikh} Automata},
    URL = {https://doi.org/10.1007/s00224-017-9817-2},
    Volume = {62},
    Year = {2018},
    bdsk-url-1 = {https://doi.org/10.1007/s00224-017-9817-2},
    date-added = {2018-10-04 12:56:38 +0000},
    date-modified = {2020-05-07 07:21:01 +0200},
    day = {01},
    doi = {10.1007/s00224-017-9817-2}
}

@article{Cadilhac2018, Abstract = {The Parikh automaton model equips a finite automaton with integer registers and imposes a semilinear constraint on the set of their final settings. Here the theories of typed monoids and of rational series are used to characterize the language classes that arise algebraically. Complexity bounds are derived, such as containment of the unambiguous Parikh automata languages in NC1. Affine Parikh automata, where each transition applies an affine transformation on the registers, are also considered. Relying on these characterizations, the landscape of relationships and closure properties of the classes at hand is completed, in particular over unary languages.}, Author = {Cadilhac, Micha{\"e}l and Krebs, Andreas and McKenzie, Pierre}, File = {Cadilhac2018_Article_TheAlgebraicTheoryOfParikhAuto (0) - a - a - z.pdf}, ISSN = {1433-0490}, Journal = {Theory of Computing Systems}, Month = {Jul}, Number = {5}, Pages = {1241--1268}, Title = {The Algebraic Theory of {Parikh} Automata}, URL = {https://doi.org/10.1007/s00224-017-9817-2}, Volume = {62}, Year = {2018}, bdsk-url-1 = {https://doi.org/10.1007/s00224-017-9817-2}, date-added = {2018-10-04 12:56:38 +0000}, date-modified = {2020-05-07 07:21:01 +0200}, day = {01}, doi = {10.1007/s00224-017-9817-2} }