Introduces idefix-free languages and extends hierarchies of external contextual grammars using subregular selection languages.
The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 2polarities
background 2representative citing papers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.
A research roadmap analyzing the current state of search-based software engineering with foundation models, outlining challenges and directions across three integration aspects.
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
citing papers explorer
-
Idefix-Free Languages and Their Application in External Contextual Grammars
Introduces idefix-free languages and extends hierarchies of external contextual grammars using subregular selection languages.
-
Correctness Notions for Petri Nets with Identifiers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.
-
Search-Based Software Engineering and AI Foundation Models: Current Landscape and Future Roadmap
A research roadmap analyzing the current state of search-based software engineering with foundation models, outlining challenges and directions across three integration aspects.
-
Descriptional Complexity of Finite Automata -- Selected Highlights
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
-
String Covering: A Survey
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.