Finite counting automata
From MaRDI portal
Publication:5728775
DOI10.1016/S0019-9958(62)90244-9zbMath0118.12506OpenAlexW2079133396MaRDI QIDQ5728775
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
Related Items (12)
Rational languages and the Burnside problem ⋮ The theory of languages ⋮ The theory of languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Characterizing regular languages with polynomial densities ⋮ Local limit laws for symbol statistics in bicomponent rational models ⋮ Sur les séries associees à certains systèmes de Lindenmayer ⋮ Unnamed Item ⋮ Generalized cancellation-and-permutation properties, regular languages and supports of rational series ⋮ Non-prinicipalité du cylindre des langages à compteur ⋮ Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
This page was built for publication: Finite counting automata
