Finite counting automata

DOI10.1016/S0019-9958(62)90244-9MaRDI QIDQ5728775zbMATH OpenOpenAlexFDO

Authors Marcel Paul Schützenberger

Publication date 1962

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(62)90244-9

zbMATH Keywords

numerical analysis

Cited in

(14)

• Rational languages and the Burnside problem
• Sur les séries associees à certains systèmes de Lindenmayer
• Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
• scientific article; zbMATH DE number 3876606 (Why is no real title available?)
• Generalized cancellation-and-permutation properties, regular languages and supports of rational series
• scientific article; zbMATH DE number 3677223 (Why is no real title available?)
• Non-prinicipalité du cylindre des langages à compteur
• Characterizing regular languages with polynomial densities
• The theory of languages
• scientific article; zbMATH DE number 3293675 (Why is no real title available?)
• The theory of languages
• Local limit laws for symbol statistics in bicomponent rational models
• Large deviation properties for pattern statistics in primitive rational models
• Commutative \(\mathbb{N}\)-rational series of polynomial growth

This page was built for publication: Finite counting automata

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