The following pages link to Finite state languages (Q3249330):
Displaying 40 items.
- On the periodic boundary value problem for Duffing type fractional differential equation with \(p\)-Laplacian operator (Q283472) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- Quantifying communication in synchronized languages (Q344766) (← links)
- Similarity in languages and programs (Q391201) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Entropy rates and finite-state dimension (Q817815) (← links)
- Execution information rate for some classes of automata (Q899317) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- The growth functions of finitely generated semigroups (Q1149001) (← links)
- On the limit set of some universal cellular automata (Q1210540) (← links)
- Extensions of rooted trees and their applications (Q1241525) (← links)
- Capacity, complexity, construction (Q1353887) (← links)
- Local Hausdorff dimension (Q1899101) (← links)
- A note on inherent replication properties of local cellular automata transition functions (Q1906444) (← links)
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028) (← links)
- A similarity measure for formal languages based on convergent geometric series (Q2164738) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Entropy of regular timed languages (Q2343131) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Finite state models for perception (Q2396127) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- Finite state and finite stop quantum languages (Q2506022) (← links)
- Block-statistic matrices and associated finite-state languages (Q2521883) (← links)
- Generating test programs from syntax (Q2535484) (← links)
- Tree acceptors and some of their applications (Q2544414) (← links)
- Plex languages (Q2547801) (← links)
- On finitely generated subsemigroups of a free semigroup (Q2548666) (← links)
- ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES (Q3084684) (← links)
- Asymptotic Subword Complexity (Q3166955) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
- Stochastic grammars and languages (Q4045668) (← links)
- Compression and entropy (Q5096807) (← links)
- Definitions and properties of entropy and distance for regular languages (Q5210870) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)
- A New Hierarchy for Automaton Semigroups (Q5859663) (← links)
- Volume formula and growth rates of the balls of strings under the edit distances (Q6096340) (← links)
- Weights of formal languages based on geometric series with an application to automatic grading (Q6144019) (← links)
- Duality of Lattices Associated to Left and Right Quotients (Q6204124) (← links)
