Pages that link to "Item:Q5538917"
From MaRDI portal
The following pages link to A note on undecidable properties of formal languages (Q5538917):
Displaying 27 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Insertion languages (Q796994) (← links)
- Carathéodory extensions of subclasses of regular languages (Q832959) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- On the pre-AFL of \([lg\;n]\) space and related families of languages (Q1231780) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Theory of formal grammars (Q1846334) (← links)
- A logic for document spanners (Q2322723) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Derivation-bounded languages (Q2533505) (← links)
- What makes some language theory problems undecidable (Q2540268) (← links)
- Time-bounded grammars and their languages (Q2548174) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (Q3073627) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- On some transducer equivalence problems for families of languages (Q3806848) (← links)
- (Q3956424) (← links)
- On languages satisfying “interchange Lemma” (Q5286056) (← links)
- Context-Freeness of Parsing Expression Languages is Undecidable (Q5384531) (← links)
- On the equivalence and containment problems for context-free languages (Q5563366) (← links)
- On the equivalence and containment problems for context-free languages (Q5569456) (← links)
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies (Q6114832) (← links)
