The following pages link to Matti Linna (Q1171886):
Displaying 19 items.
- (Q799120) (redirect page) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- The equations \(h(w)=w^ n\) in binary alphabets (Q799819) (← links)
- Stability in L systems (Q802316) (← links)
- Periodicity and ultimate periodicity of D0L systems (Q807022) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- On purely morphic characterizations of context-free languages (Q1098315) (← links)
- Grammars, derivation modes and properties of indexed and type-0 languages (Q1098316) (← links)
- Bounded D0L languages (Q1098317) (← links)
- Bifaithful starry transductions (Q1116707) (← links)
- A note on morphic characterization of languages (Q1171887) (← links)
- Defining families of trees with E0L grammars (Q1179185) (← links)
- Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- (Q1233728) (redirect page) (← links)
- The DOL-ness for context-free languages is decidable (Q1233729) (← links)
- A decidability result for deterministic \(\omega\)-context-free languages (Q1239008) (← links)
- Two decidability results for deterministic pushdown automata (Q1254241) (← links)
- (Q3339310) (← links)
