Characterizing regular languages with polynomial densities
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 494-503
- https://doi.org/10.1007/3-540-55808-x_48
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their RepresentationSIAM Journal on Computing, 1989
- Can the catenation of two weakly sparse languages be dense?Discrete Applied Mathematics, 1988
- Rational Series and Their LanguagesPublished by Springer Nature ,1988
- Semirings, Automata, LanguagesPublished by Springer Nature ,1986
- A homomorphic characterization of regular languagesDiscrete Applied Mathematics, 1982
- OPEN PROBLEMS ABOUT REGULAR LANGUAGES11Research supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No. A-1617. Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.Published by Elsevier ,1980
- Automata-Theoretic Aspects of Formal Power SeriesPublished by Springer Nature ,1978
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Finite counting automataInformation and Control, 1962