Boguslaw Schreyer
ABSTRACT
A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast majority of texts. However, a finite automata approach offers simplicity and visualization of synchronization mechanisms.
- Silberschatz, A., and Galvin, P., Operating system concepts, 5th edition, John Wiley & Sons, 1999 Google Scholar
Digital Library
- Sipser, M., Introduction to the theory of computation, PWS Publishing Company, 1997 Google ScholarDigital Library
- Schreyer, B., NFA and DFA for OS algorithms modeling , KBN grant report, November 2005.Google Scholar
Index Terms
- Finite automata models for CS problem with binary semaphore
Recommendations
Finite automata models for CS problem with binary semaphore
A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
Descriptional complexity of determinization and complementation for finite automata
CATS 2011: Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119In this paper we study the subset construction that transforms nondeterministic finite automata (NFA) to deterministic finite automata (DFA). It is well known that given a n-state NFA, the subset construction algorithm produces a 2n-state DFA in the ...
Comments