MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Algebraic Recognizability of Languages." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Algebraic recognizability of languages
by Pascal Weil — 2004 — In Proc. 29th Int. Symp. Math. Found. of Comp. Sci. (MFCS’04
…Algebraic Recognizability of Languages ⋆ Pascal Weil LaBRI, CNRS and Université Bordeaux-1, pascal…
Cited by 6 (1 self) – Add To MetaCart

Polynomial closure and unambiguous product
by Jean-eric Pin, Pascal Weil — 1997 — Theory Comput. Systems
…, the polynomial closure leads to natural hierarchies among recognizable languages. Define a boolean algebra as a…
Cited by 23 (4 self) – Add To MetaCart

Polynomial Closure of Group Languages and Open Sets of the Hall Topology
by Jean-Eric Pin — 1994
… among recognizable languages. Define a boolean algebra as a set of languages of A closed under finite…
Cited by 7 (4 self) – Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB