# Recognizable set

## Papers overview

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

2015

2015

- Ann. Pure Appl. Logic
- 2015

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine… (More)

Is this relevant?

2010

2010

- Theor. Comput. Sci.
- 2010

Abstract A set X ⊆ N is S -recognizable for an abstract numeration system S , if the set rep S ( X ) of its representations is… (More)

Is this relevant?

2005

2005

- Theor. Comput. Sci.
- 2005

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize… (More)

Is this relevant?

2004

2004

- MFCS
- 2004

Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a… (More)

Is this relevant?

2001

2001

- Developments in Language Theory
- 2001

It is shown that any recognizable set of finite N-free pomsets is axiomatizable in counting monadic second order logic… (More)

Is this relevant?

1998

1998

- STACS
- 1998

We prove that for each κ, there exists a MSO-transduction that associates with every graph of tree-width at most k one of its… (More)

Is this relevant?

1996

1996

- Mathematical Structures in Computer Science
- 1996

We show that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an… (More)

Is this relevant?

1993

1993

- Dagstuhl Seminar on Graph Transformations in…
- 1993

We establish that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an… (More)

Is this relevant?

1992

1992

- Acta Informatica
- 1992

We analyze some algebraic properties of semigroups whose finite subsets are recognizable (finitely recognizable semigroups). We… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Inf. Comput.
- 1990

Abstract The notion of a recognizable set of finite graphs is introduced. Every set of finite graphs, that is definable in… (More)

Is this relevant?