Finite state languages
From MaRDI portal
Publication:3249330
DOI10.1016/S0019-9958(58)90082-2zbMath0081.14503OpenAlexW2017473312WikidataQ55980513 ScholiaQ55980513MaRDI QIDQ3249330
Publication date: 1958
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(58)90082-2
Related Items
Lossiness of communication channels modeled by transducers1 ⋮ On the periodic boundary value problem for Duffing type fractional differential equation with \(p\)-Laplacian operator ⋮ Asymptotic Subword Complexity ⋮ Some remarks on real numbers induced by first-order spectra ⋮ Capacity, complexity, construction ⋮ The Kolmogorov complexity of infinite words ⋮ Local Hausdorff dimension ⋮ A note on inherent replication properties of local cellular automata transition functions ⋮ Quantifying communication in synchronized languages ⋮ Finite state models for perception ⋮ Quantifying Communication in Synchronized Languages ⋮ A similarity measure for formal languages based on convergent geometric series ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Similarity in languages and programs ⋮ Compression and entropy ⋮ Volume formula and growth rates of the balls of strings under the edit distances ⋮ Execution information rate for some classes of automata ⋮ Weights of formal languages based on geometric series with an application to automatic grading ⋮ The growth functions of finitely generated semigroups ⋮ Recognizability in residuated lattices ⋮ Stochastic grammars and languages ⋮ Duality of Lattices Associated to Left and Right Quotients ⋮ On the limit set of some universal cellular automata ⋮ FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME ⋮ Dimension, entropy rates, and compression ⋮ Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 ⋮ Finite state and finite stop quantum languages ⋮ Extensions of rooted trees and their applications ⋮ Definitions and properties of entropy and distance for regular languages ⋮ Block-statistic matrices and associated finite-state languages ⋮ ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES ⋮ Effective entropies and data compression ⋮ Generating test programs from syntax ⋮ Tree acceptors and some of their applications ⋮ Plex languages ⋮ On finitely generated subsemigroups of a free semigroup ⋮ Sampling automata and programs ⋮ A New Hierarchy for Automaton Semigroups ⋮ Entropy of regular timed languages ⋮ Computation theory of cellular automata ⋮ Entropy rates and finite-state dimension
This page was built for publication: Finite state languages
