On some combinatorial properties of LINUX process trees

DOI10.22405/2226-8383-2018-19-2-151-162zbMath1434.68126OpenAlexW4246427093MaRDI QIDQ5109639

Nikolaĭ Nikolaevich Efanov

Publication date: 13 May 2020

Published in: Chebyshevskii sbornik (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/cheb646

zbMATH Keywords

groupsmathematical modelingtreesformal grammarssystem callsenumeration combinatoricscheckpoint restoreprocess treeUnix-like operating systems

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Grammars and rewriting systems (68Q42) Data structures (68P05) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Defining Contexts in Context-Free Grammars
• Multi-Component Tree Insertion Grammars

This page was built for publication: On some combinatorial properties of LINUX process trees