https://aclanthology.org/W13-3007/
Learning Subregular Classes of Languages with Factored Deterministic Automata - ACL Anthology
Jeffrey Heinz, James Rogers. Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13). 2013.
deterministic automatalearningclasseslanguages
https://arxiv.org/abs/1405.5596
[1405.5596] Decision Problems for Deterministic Pushdown Automata on Infinite Words
Abstract page for arXiv paper 1405.5596: Decision Problems for Deterministic Pushdown Automata on Infinite Words
decision problemspushdown automata14055596
https://www.naukri.com/code360/library/deterministic-finite-automata
Deterministic Finite Automata (DFA) - Naukri Code 360
A Deterministic Finite Automaton (DFA) is a type of finite state machine used in automata theory to recognize patterns or regular languages.
deterministic finite automatadfanaukricode360