Pages that link to "Item:Q2540268"
From MaRDI portal
The following pages link to What makes some language theory problems undecidable (Q2540268):
Displaying 19 items.
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- On some decision questions concerning pushdown machines (Q593781) (← links)
- On simple generators of recursively enumerable languages (Q743126) (← links)
- Prefix and equality languages of rational functions are co-context-free (Q1124356) (← links)
- Recursivite et cônes rationnels fermés par intersection (Q1133331) (← links)
- Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048) (← links)
- On the finite-valuedness problem for sequential machines (Q1173410) (← links)
- Bounded AFLs (Q1227455) (← links)
- On the pre-AFL of \([lg\;n]\) space and related families of languages (Q1231780) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Theory of formal grammars (Q1846334) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- Substitution and bounded languages (Q2550965) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- Input-driven multi-counter automata (Q5918274) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
