Taishin Y. Nishida

26 papers A* 1C 1Journal 13Unranked 10

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Assembly membrane systems. J. Membr. Comput. Taishin Y. Nishida
2020	—	`conf`	Evolutionary P Systems: The Notion and an Example. Int. Conf. on Membrane Computing Taishin Y. Nishida
2012	J	`jnl`	An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules. Theor. Comput. Sci. Taishin Y. Nishida
2012	—	`conf`	Earley's Parsing Algorithm and k-Petri Net Controlled Grammars. Languages Alive Taishin Y. Nishida
2009	J	`jnl`	An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity. J. Autom. Lang. Comb. Taishin Y. Nishida
2008	—	`conf`	An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. DCFS Takashi Emori, Taishin Y. Nishida
2007	—	`conf`	Descriptional Complexities of Grammars over Alphabets with Finite Parameters. DCFS Taishin Y. Nishida
2007	J	`jnl`	Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm. Int. J. Found. Comput. Sci. Taishin Y. Nishida
2005	—	`conf`	Membrane Algorithms. Workshop on Membrane Computing Taishin Y. Nishida
2005	J	`jnl`	Some New Aspects of Word-Length Controlled DT0L Systems. J. Autom. Lang. Comb. Taishin Y. Nishida
2002	—	`conf`	Descriptional complexities of grammars over alphabets with finite parameters. DCFS Taishin Y. Nishida
2002	C	`conf`	On the Descriptional Complexity of Some Variants of Lindenmayer Systems. Developments in Language Theory Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel
2001	—	`conf`	A Definition of Parikh Controlled Context-Free Grammars and Some Properties of Them. Words, Semigroups, and Transductions Taishin Y. Nishida, Shigeko Seki
2001	J	`jnl`	Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems. J. Autom. Lang. Comb. Taishin Y. Nishida
2000	J	`jnl`	Grouped partial ET0L systems and parallel multiple context-free grammars. Theor. Comput. Sci. Taishin Y. Nishida, Shigeko Seki
2000	—	`conf`	Multiset and K -Subset Transforming Systems. WMP Taishin Y. Nishida
2000	J	`jnl`	On slender 0L languages. Theor. Comput. Sci. Taishin Y. Nishida, Arto Salomaa
1999	—	`conf`	Word Length Controlled DT0L Systems and Slender Languages. Jewels are Forever Taishin Y. Nishida
1996	—	`conf`	A note on grammatical inference of slender context-free languages. ICGI Yuji Takada, Taishin Y. Nishida
1996	J	`jnl`	Slender 0L Languages. Theor. Comput. Sci. Taishin Y. Nishida, Arto Salomaa
1995	J	`jnl`	Quasi-Deterministic 0L Systems and Their Representation. Theor. Comput. Sci. Taishin Y. Nishida
1994	J	`jnl`	Invariant Sets for Substitution. J. Comput. Syst. Sci. Taishin Y. Nishida, Youichi Kobuchi
1992	A*	`conf`	Quasi-Deterministic 0L Systems. ICALP Taishin Y. Nishida
1991	—	`ch.`	A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing. Software Science and Engineering Taishin Y. Nishida
1987	J	`jnl`	Repeatable Words for Substitution. Theor. Comput. Sci. Taishin Y. Nishida, Youichi Kobuchi
1984	J	`jnl`	Recurrent Words for Substitution. Math. Syst. Theory Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.