Hofman, Piotr
- Decidability of Weak Simulation on One-counter Nets
2013/04/15 by Hofman, Piotr, Mayr, Richard, Totzke, Patrick · 1 citation
#68Q45 #D.2.4 #F.1.1 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- Linear Combinations of Unordered Data Vectors
2016/10/05 by Piotr Hofman, Jérôme Leroux, Hofman, Piotr +3 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #Computability, Logic, AI Algorithms #DNA and Biological Computing #F.1.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #semigroups and automata theory
- Parikh's theorem for infinite alphabets
2021/04/24 by Hofman, Piotr, Juzepczuk, Marta, Lasota, Sławomir +1 · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
- Unboundedness problems for languages of vector addition systems
2018/02/19 by Wojciech Czerwiński, Czerwiński, Wojciech, Piotr Hofman +3 · 1 citation
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, programming, and type systems #semigroups and automata theory
- Solvability of orbit-finite systems of linear equations
2022/01/22 by Ghosh, Arka, Hofman, Piotr, Lasota, Sławomir · 1 citation
#Computation and Language (cs.CL) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)