Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Volume and Entropy of Regular Timed Languages: Discretization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characterization of nonexpansive grammars by rational power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Execution information rate for some classes of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity in languages and programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown timed automata: A binary reachability characterization and safety verification. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic models and ambiguity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression and entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossiness of Communication Channels Modeled by Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noncomputability of the channel capacity of context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropy of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure generating function and entropy of tuple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane computing. An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information gain of black-box testing / rank
 
Normal rank

Latest revision as of 12:13, 14 July 2024

scientific article
Language Label Description Also known as
English
Information rate of some classes of non-regular languages: an automata-theoretic approach
scientific article

    Statements

    Information rate of some classes of non-regular languages: an automata-theoretic approach (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 September 2017
    0 references
    0 references
    automata
    0 references
    formal languages
    0 references
    Shannon information
    0 references
    0 references