2 papers
cs.FL2026
Measure Many Quantum Finite Automata on Infinite Words
Abhisek Midya, A Baskar
We define a quantum computational model over infinite words, called Measure-Many Quantum Büchi Automata (MMQBA), which extends Measure-many Quantum Finite automata (MMQFA) to the i…
cs.CL2023
Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
Shreekanth M Prabhu, Abhisek Midya
The study of spoken languages comprises phonology, morphology, and grammar. The languages can be classified as root languages, inflectional languages, and stem languages. In additi…