Finite state languages
From MaRDI portal
Cited in
(47)- Computation theory of cellular automata
- The growth functions of finitely generated semigroups
- On the limit set of some universal cellular automata
- Extensions of rooted trees and their applications
- Capacity, complexity, construction
- Local Hausdorff dimension
- A note on inherent replication properties of local cellular automata transition functions
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
- A similarity measure for formal languages based on convergent geometric series
- Sampling automata and programs
- Entropy of regular timed languages
- The Kolmogorov complexity of infinite words
- Finite state models for perception
- Information rate of some classes of non-regular languages: an automata-theoretic approach
- Dimension, entropy rates, and compression
- Finite state and finite stop quantum languages
- Block-statistic matrices and associated finite-state languages
- Generating test programs from syntax
- Tree acceptors and some of their applications
- Plex languages
- On finitely generated subsemigroups of a free semigroup
- On the periodic boundary value problem for Duffing type fractional differential equation with p-Laplacian operator
- Some remarks on real numbers induced by first-order spectra
- On the density of regular and context-free languages
- Asymptotic subword complexity
- Quantifying communication in synchronized languages
- Quantifying communication in synchronized languages
- Finding the growth rate of a regular or context-free language in polynomial time
- Similarity in languages and programs
- Stochastic grammars and languages
- Compression and entropy
- Definitions and properties of entropy and distance for regular languages
- Lossiness of communication channels modeled by transducers1
- A new hierarchy for automaton semigroups
- Volume formula and growth rates of the balls of strings under the edit distances
- Weights of formal languages based on geometric series with an application to automatic grading
- Recognizability in residuated lattices
- Duality of Lattices Associated to Left and Right Quotients
- Fractal dimensions of k-automatic sets
- Computing the bandwidth of meager timed automata
- Asymptotic reasoning with two variables
- Relative densities of formal languages
- Bandwidth of timed automata: 3 classes
- Weighing obese timed languages
- Effective entropies and data compression
- Entropy rates and finite-state dimension
- Execution information rate for some classes of automata
This page was built for publication: Finite state languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3249330)
