In mathematics, logic and computer science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursiveâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Martin Cadek, Marek KrcÃ¡l, JirÃ Matousek, LukÃ¡s VokrÃnek, Uli Wagner
- Discrete & Computational Geometry
- 2014

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, fromâ€¦Â (More)

Is this relevant?

2010

2010

- Mark Jenkins, JoÃ«l Ouaknine, Alexander Moshe Rabinovich, James Worrell
- 2010 25th Annual IEEE Symposium on Logic inâ€¦
- 2010

Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Booleanâ€¦Â (More)

Is this relevant?

1998

1998

- Steffen Lange, Jochen Nessel, Rolf Wiehagen
- Annals of Mathematics and Artificial Intelligence
- 1998

We study learning of indexable families of recursive languages from good examples. We show that this approach can be considerablyâ€¦Â (More)

Is this relevant?

1996

1996

- Rusins Freivalds, Thomas Zeugmann
- Ershov Memorial Conference
- 1996

The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive dataâ€¦Â (More)

Is this relevant?

1996

1996

- Henning Fernau
- Fundam. Inform.
- 1996

In this paper, we emphasize the differences of grammar families and their properties versus language families and theirâ€¦Â (More)

Is this relevant?

Review

1995

Review

1995

- Thomas Zeugmann, Steffen Lange
- GOSLER Final Report
- 1995

The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well asâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Wolfgang Kunz, Dhiraj K. Pradhan
- The IEEE International Symposium on Circuits andâ€¦
- 1994

Motivated by the problem of test pattern generation in digital circuits, this paper presents a novel technique called recursiveâ€¦Â (More)

Is this relevant?

1993

1993

- Steffen Lange, Thomas Zeugmann
- Int. J. Found. Comput. Sci.
- 1993

In the present paper we study the learnability of enumerable families L of uniformly recursive languages in dependence on theâ€¦Â (More)

Is this relevant?

1975

1975

- Peter J. Downey, Ravi Sethi
- 16th Annual Symposium on Foundations of Computerâ€¦
- 1975

This paper considers simple LISP-like languages for the recursive definition of functions, focusing upon the connections betweenâ€¦Â (More)

Is this relevant?

1974

1974

- Bruno Courcelle, Jean Vuillemin
- STOC
- 1974

In this paper, we provide a simple recursive programming language with a semantics and a formal proof system, along the lines ofâ€¦Â (More)

Is this relevant?