Pages that link to "Item:Q1041028"
From MaRDI portal
The following pages link to Detecting palindromes, patterns and borders in regular languages (Q1041028):
Displaying 12 items.
- On regular realizability problems for context-free languages (Q327306) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Detecting patterns in finite regular and context-free languages (Q990125) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Automata equipped with auxiliary data structures and regular realizability problems (Q2096592) (← links)
- On expressive power of regular realizability problems (Q2262977) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Regular Realizability Problems and Context-Free Languages (Q5500698) (← links)
- Properties of graphs specified by a regular language (Q5896894) (← links)
- Properties of graphs specified by a regular language (Q5918788) (← links)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances (Q5918790) (← links)
- Decision problems on copying and shuffling (Q6614538) (← links)
