Entropy Sensitivity of Languages Defined by Infinite Automata, via Markov Chains With Forbidden Transitions

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2010.07.020
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

Reversibility and Entropy Production of Inhomogeneous Markov Chains

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2006English

Compositionality for Markov Reward Chains With Fast and Silent Transitions

Performance Evaluation
Computer NetworksSimulationHardwareCommunicationsArchitectureModelingSoftware
2009English

Ergodic Theory of Markov Chains Admitting an Infinite Invariant Measure

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1953English

Measurement of Transverse Hyperfine Interaction by Forbidden Transitions

Physical Review B
2015English

Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

The Cross-Entropy Method With Patching for Rare-Event Simulation of Large Markov Chains

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2010English

Randomized Modulation of Power Converters via Markov Chains

IEEE Transactions on Control Systems Technology
ControlSystems EngineeringElectricalElectronic Engineering
1997English

Closure of Hedge-Automata Languages by Hedge Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy