Pages that link to "Item:Q3393412"
From MaRDI portal
The following pages link to Regular Expressions with Numerical Constraints and Automata with Counters (Q3393412):
Displaying 9 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Deriving generic bounds for time-series constraints based on regular expressions characteristics (Q1706597) (← links)
- Counting with range concatenation grammars (Q1870577) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- (Q5111236) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- Succinct determinisation of counting automata via sphere construction (Q6536322) (← links)