scientific article; zbMATH DE number 7503138
From MaRDI portal
Publication:5067948
Recommendations
- Parameterized complexity of some prefix-vocabulary fragments of first-order logic
- Fixed-parameter decidability: extending parameterized complexity analysis
- Fixed-parameter tractability, definability, and model-checking
- Feferman-vaught decompositions for prefix classes of first order logic
- scientific article; zbMATH DE number 883958
- Complexity results for prefix grammars
- Complexity of proper prefix-convex regular languages
- Complexity of proper prefix-convex regular languages
- scientific article; zbMATH DE number 4116512
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5067948)