https://aclanthology.org/D18-1293/
Incremental Computation of Infix Probabilities for Probabilistic Finite Automata - ACL Anthology
Marco Cognetta, Yo-Sub Han, Soon Chan Kwon. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. 2018.
finite automataincrementalcomputationinfixprobabilities
https://expertise.unibs.it/resource/item/12895?language=en-US
UNIFIND - UNIBS - Incremental Determinization of Finite Automata in Model-Based Diagnosis of Active...
Unifind is a portal where you can discover the expertise within a university by searching among experts, courses, professions, people, publications, and...
finite automata
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.70
Improved Parallel Derandomization via Finite Automata with Applications
finite automataimprovedparallelviaapplications
https://idr.nitk.ac.in/items/d8e649fe-02a4-4a01-ac6e-58ccd65d1ca9
Symbolic Deterministic Finite Automata-based Automated Fertilizer Prescription
Sustainable agriculture requires the use of an adequate amount of fertilizers. In this research work, initially, an attempt was made to classify soil fertility...
finite automatasymbolicdeterministicbasedautomated
https://techyoulike.com/what-means-dfa/
What Does DFA Mean? Unraveling the Power of Deterministic Finite Automata - TechYouLike
Jul 13, 2025 - Understanding the world of computer science and formal languages often requires grappling with complex concepts. Among these, the Deterministic Finite
the power of
https://theses.liacs.nl/2532
Finite accessibility of Higher-Dimensional Automata and unbounded parallelism of their languages...
A thesis written by Baronner, T. (Thomas) at Leiden University (LIACS).
finiteaccessibilityhigherdimensional
https://www.ccbp.in/blog/articles/linear-bounded-automata
Linear Bounded Automata: The Bridge Between Finite Automata and Turing Machines
Explore linear bounded automata structure, context-sensitive languages, theory milestones, and their importance in computation and automata theory.
the bridgelinearboundedautomatafinite
https://ace.ewapub.com/article/view/33104
A Review of String Matching Algorithms with Emphasison Finite Automata
String matching is a fundamental problem in computer science with applications in text processing, bioinformatics, and information retrieval. Over the past...
a reviewstring matchingalgorithmsfiniteautomata