Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,350,566 papers from all fields of science
Search
Sign In
Create Free Account
Recursive language
Known as:
Undecidable
, Recursive Languages
, Decidable language
Expand
In mathematics, logic and computer science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursive…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
38 relations
Abstract family of languages
Algorithm
Blum axioms
Chomsky hierarchy
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
High-speed recursive digital filter realization
H. Loomis
,
B. Sinha
2017
Corpus ID: 62700220
Pipeline techniques have been successfully applied to speeding up processing in both general- and special-purpose digital…
Expand
2000
2000
An analytical model for delay and crosstalk estimation with application to decoupling
M. Becer
,
I. Hajj
Proceedings IEEE First International Symposium…
2000
Corpus ID: 27209901
The impact of interconnect coupling, in the form of delay and crosstalk, in deep submicron integrated circuit design is…
Expand
1994
1994
Learning Languages by Collecting Cases and Tuning Parameters
Y. Sakakibara
,
K. Jantke
,
Steffen Lange
AII/ALT
1994
Corpus ID: 3150943
We investigate the problem of case-based learning of formal languages. Case-based reasoning and learning is a currently booming…
Expand
1992
1992
Generalizations of Enumeration Reducibility Using Recursive Infinitary Propositional Sentences
C. Ash
Annals of Pure and Applied Logic
1992
Corpus ID: 41100153
1990
1990
Nonrecursive and recursive stack filters and their filtering behavior
Peter D. Wendt
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 28063082
It is shown that stack filters that are based on symmetric threshold functions and preserve median-filter roots make all inputs…
Expand
Highly Cited
1983
Highly Cited
1983
A short proof of two recently discovered independence results using recursion theoretic methods
E. Cichon
1983
Corpus ID: 122915425
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…
Expand
1975
1975
Picture Reconstruction from Projections
R. Kashyap
,
M. Mittal
IEEE transactions on computers
1975
Corpus ID: 38094618
In this paper we will present two methods for the reronstruction of a two-dimensional picture from its one-dimensional…
Expand
1974
1974
An Algorithm for High-Speed Digital Filters
W. Little
IEEE transactions on computers
1974
Corpus ID: 36385582
This paper describes an algorithm that is suitable for fast implementations of nonrecursive and recursive digital filters. High…
Expand
1974
1974
Stability Criterion for Recursive Filters
P. Pistor
IBM Journal of Research and Development
1974
Corpus ID: 13077076
A new criterion is derived that relates the stability of two-dimensional recursive filters to the properties of its cepstrum. It…
Expand
Highly Cited
1968
Highly Cited
1968
Nonrecursive digital filters: Design methods for achieving specifications on frequency response
H. Helms
1968
Corpus ID: 62437844
A simple and effective method for designing a nonrecursive digital filter is described. This method is constructed so that it is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE