Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent posts tagged regular-languages
2,489
2,489 views
Good Read for TOC
Total process will be 8 including main.Newly created child process will be 7.Since for n fork() calls total child process will be 2n - 1
Umesh Shelke
2,489
views
posted
Sep 27, 2025
Useful Links
useful-blogs
theory-of-computation
regular-languages
+
–
9,224
9,224 views
Minimal Deterministic Finite Automata
2, 3 and 4 are possible for implementing inverted list. Basically we need an indexed access to the file (as in hashing) but this might not be there in a simple sequential...
Shaik Masthan
9,224
views
posted
Nov 7, 2019
Theory of Computation
regular-languages
notes
minimal-state-automata
finite-automata
+
–
To see more, click for the
full list of questions
or
popular tags
.