What makes some language theory problems undecidable
From MaRDI portal
Cites work
- A note on undecidable properties of formal languages
- An Approach to a Unified Theory of Automata
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- One-way stack automata
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Studies in abstract families of languages
Cited in
(21)- Prefix and equality languages of rational functions are co-context-free
- Recursivite et cônes rationnels fermés par intersection
- Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression
- On the finite-valuedness problem for sequential machines
- Bounded AFLs
- On the pre-AFL of \([lg\;n]\) space and related families of languages
- Remarks on blind and partially blind one-way multicounter machines
- Generalizing input-driven languages: theoretical and practical benefits
- Theory of formal grammars
- On Boolean closed full trios and rational Kripke frames
- On counting functions and slenderness of languages
- Substitution and bounded languages
- The emptiness problem for valence automata over graph monoids
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
- Counter machines, Petri nets, and consensual computation
- Input-driven multi-counter automata
- On some decision questions concerning pushdown machines
- Existential Definability over the Subword Ordering
- Reversible computations of one-way counter automata
- State-freezing pushdown automata
- On simple generators of recursively enumerable languages
This page was built for publication: What makes some language theory problems undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540268)
