Relativized codes, finite decodability, and bounded languages
From MaRDI portal
Cites work
- Bounded Algol-Like Languages
- Checking automata and one-way stack languages
- Decidability of code properties
- Decidability of the finiteness of ranges of tree transductions
- Generalizations of Code Languages with Marginal Errors
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 2038733 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Iterated stack automata and complexity classes
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- On ETOL systems of finite index
- On finite-index indexed grammars and their restrictions
- On the density of context-free and counter languages
- One way finite visit automata
- Petri net algorithms in the theory of matrix grammars
- Relativized codes
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Semilinearity of families of languages
- Techniques for showing the decidability of the boundedness problem of language acceptors
- The undecidability of the ambiguity problem for minimal linear grammars
- Unboundedness problems for languages of vector addition systems
- Unboundedness problems for machines with reversal-bounded counters
This page was built for publication: Relativized codes, finite decodability, and bounded languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861884)
