The following pages link to (Q5422507):
Displaying 8 items.
- Regular languages of thin trees (Q290908) (← links)
- On well quasiordering of finite languages (Q1356526) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\) (Q2314419) (← links)
- On the regularity and learnability of ordered DAG languages (Q2399247) (← links)
- (Q3365845) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Automata, Languages and Programming (Q5466521) (← links)