Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Probabilistic finite-state machines--part I.

Enrique Vidal1, Franck Thollard, Colin de la Higuera

  • 1Departamento de Sistemas Informáticos y Computación and Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Camino de Vera s/n, E-46071 Valencia, Spain. evidal@iti.upv.es

IEEE Transactions on Pattern Analysis and Machine Intelligence
|July 15, 2005
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The Relentless Progression of Metabolic Dysfunction-associated Steatotic Liver Disease in Liver Transplantation in Spain.

Transplantation·2025
Same author

EWS::FLI1 expression in human embryonic mesenchymal stem cells leads to transcriptional reprograming, defective DNA damage repair and Ewing sarcoma.

Nature communications·2025
Same author

External validation of models to predict hepatocellular carcinoma in Hepatitis C Virus cured F3-F4 patients.

United European gastroenterology journal·2024
Same author

Liquidhope: methylome and genomic profiling from very limited quantities of plasma-derived DNA.

Briefings in bioinformatics·2023
Same author

In vivo temporal resolution of acute promyelocytic leukemia progression reveals a role of <i>Klf4</i> in suppressing early leukemic transformation.

Genes & development·2022
Same author

Chromatin topology defines estradiol-primed progesterone receptor and PAX2 binding in endometrial cancer cells.

eLife·2022
Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Mixture of Global and Local Experts with Diffusion Transformer for Controllable Face Generation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Achieving Text-based Person Retrieval with Any Granularity.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This paper surveys probabilistic finite-state machines, essential for pattern recognition tasks like machine learning and computational linguistics. It explores their definitions, properties, and connections to related generative models.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Computational Linguistics

Background:

  • Probabilistic finite-state machines (PFSMs) are foundational in pattern recognition.
  • They are applied across diverse fields including machine learning, computational biology, and natural language processing.
  • Understanding PFSMs is crucial for advancing these interdisciplinary areas.

Purpose of the Study:

  • To provide a comprehensive survey of PFSMs, detailing their definitions and inherent properties.
  • To explore the relationships between PFSMs and other string-generating models such as hidden Markov models (HMMs) and n-grams.
  • To present current state-of-the-art theorems, algorithms, and properties related to these generative objects.

Main Methods:

  • Literature review and theoretical analysis of PFSMs.

Related Experiment Videos

  • Comparative study of PFSMs against HMMs and n-grams.
  • Development and presentation of novel theorems and algorithms.

    • Main Results:

    • A detailed exposition of PFSM definitions and properties.
    • Established connections and distinctions between PFSMs, HMMs, and n-grams.
    • A collection of theorems and algorithms representing the current state-of-the-art.

    Conclusions:

    • PFSMs are versatile tools with broad applications in pattern recognition and related fields.
    • The study clarifies the theoretical landscape of PFSMs and their relationship with other generative models.
    • This work serves as a foundational reference for researchers in machine learning, computational linguistics, and beyond.