Publication:4294173
From MaRDI portal
zbMath0816.68078MaRDI QIDQ4294173
Arto Salomaa, Grzegorz Rozenberg
Publication date: 24 May 1994
68Q45: Formal languages and automata
03D35: Undecidability and degrees of sets of sentences
68-02: Research exposition (monographs, survey articles) pertaining to computer science
03D40: Word problems, etc. in computability and recursion theory
Related Items
STATE COMPLEXITY AND APPROXIMATION, Recursively enumerable reals and Chaitin \(\Omega\) numbers, The complete realization problem for hidden Markov models: a survey and some new results, On the power of enzymatic numerical P systems, Absoluteness of subword inequality is undecidable, Natural halting probabilities, partial randomness, and zeta functions, On the membership of invertible diagonal and scalar matrices, The undecidability of some equivalence problems concerning ngsm's and finite substitutions, Slender 0L languages, Unification in sort theories and its applications, Is complexity a source of incompleteness?, Undecidability of State Complexities Using Mirror Images