Relative densities of formal languages

DOI10.1007/978-3-031-97100-6_12MaRDI QIDQ6884654zbMATH OpenFDO

Authors J. Andres Montoya

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97100-6_12

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 238432 (Why is no real title available?)
• scientific article; zbMATH DE number 3415406 (Why is no real title available?)
• A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
• Analytic combinatorics
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
• Complexity of universality and related problems for partially ordered NFAs
• Conditional densities of regular languages
• Determining the structure of the Jordan normal form of a matrix by symbolic computation
• Deterministic one-counter automata
• Finite state languages
• LATIN 2004: Theoretical Informatics
• Nearly Optimal Algorithms for Canonical Matrix Forms
• Restricted one-counter machines with undecidable universe problems
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Sur le produit de concatenation non ambigu
• The characterization of nonexpansive grammars by rational power series
• Unambiguity in automata theory
• Undecidable problems concerning densities of languages

This page was built for publication: Relative densities of formal languages

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