10 citations · 14 across the 6 of their papers we have counts for
3 papers · 1 filter
Parikh Automata on Finite and Infinite Words
Mario Grobler, Leif Sabellek, Sebastian Siebertz
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh auto…
Description Logics with Abstraction and Refinement
Carsten Lutz, Lukas Schulze
Ontologies often require knowledge representation on multiple levels of abstraction, but description logics (DLs) are not well-equipped for supporting this. We propose an extension…
Parikh Automata on Infinite Words
Mario Grobler, Leif Sabellek, Sebastian Siebertz
Parikh automata on finite words were first introduced by Klaedtke and Rueß [Automata, Languages and Programming, 2003]. In this paper, we introduce several variants of Parikh autom…