Skip to search formSkip to main contentSkip to account menu

Recursive language

Known as: Undecidable, Recursive Languages, Decidable language 
In mathematics, logic and computer science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursive… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Pipeline techniques have been successfully applied to speeding up processing in both general- and special-purpose digital… 
2000
2000
  • M. BecerI. Hajj
  • 2000
  • Corpus ID: 27209901
The impact of interconnect coupling, in the form of delay and crosstalk, in deep submicron integrated circuit design is… 
1994
1994
We investigate the problem of case-based learning of formal languages. Case-based reasoning and learning is a currently booming… 
1990
1990
It is shown that stack filters that are based on symmetric threshold functions and preserve median-filter roots make all inputs… 
Highly Cited
1983
Highly Cited
1983
Recently L. A. S. Kirby and J. Paris showed that a theorem of R L. Goodstein cannot be proved in Peano's Arithmetic. We give an… 
1975
1975
In this paper we will present two methods for the reronstruction of a two-dimensional picture from its one-dimensional… 
1974
1974
This paper describes an algorithm that is suitable for fast implementations of nonrecursive and recursive digital filters. High… 
1974
1974
A new criterion is derived that relates the stability of two-dimensional recursive filters to the properties of its cepstrum. It… 
Highly Cited
1968
Highly Cited
1968
A simple and effective method for designing a nonrecursive digital filter is described. This method is constructed so that it is…