On counting functions of languages
From MaRDI portal
Publication:1622992
DOI10.1007/978-3-319-98654-8_35OpenAlexW2886027706MaRDI QIDQ1622992FDOQ1622992
Authors: Oscar H. Ibarra, Ian McQuillan, B. Ravikumar 
Publication date: 22 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_35
Recommendations
- On counting functions and slenderness of languages
- Pushdown automata with reversal-bounded counters
- The complexity of computing the number of strings of given length in context-free languages
- On the structure of the counting function of sparse context-free languages.
- scientific article; zbMATH DE number 4033108
Cited In (11)
- Indexed counter languages
- Title not available (Why is that?)
- On the Commutative Equivalence of Algebraic Formal Series and Languages
- Counting Finite Languages by Total Word Length
- On counting functions and slenderness of languages
- On bounded linear codes and the commutative equivalence
- Counting with range concatenation grammars
- On languages in countably generated semilattices
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- Fundamentals of Computation Theory
- Characterizing language identification in terms of computable numberings
This page was built for publication: On counting functions of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622992)
