Search Sciweavers | Sciweavers

762 search results - page 18 / 153

» Intercode Regular Languages

click to vote

STACS
2001
Springer

88views Theoretical Computer Science» more STACS 2001»

A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages

13 years 11 months ago

Download vseliv.nspu.ru

We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...

Victor L. Selivanov

claim paper

Read More »

click to vote

FOCS
1999
IEEE

89views Theoretical Computer Science» more FOCS 1999»

Regular Languages Are Testable with a Constant Number of Queries

13 years 11 months ago

Download www.cs.tau.ac.il

Noga Alon, Michael Krivelevich, Ilan Newman, Mario...

claim paper

Read More »

click to vote

CTRS
1992

125views Theoretical Computer Science» more CTRS 1992»

Decidability of Regularity and Related Properties of Ground Normal Form Languages

13 years 11 months ago

Download www2.lifl.fr

ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1

Gregory Kucherov, Mohamed Tajine

claim paper

Read More »

click to vote

FOCS
1992
IEEE

135views Theoretical Computer Science» more FOCS 1992»

Back to the Future: Towards a Theory of Timed Regular Languages

13 years 11 months ago

Download www.cs.berkeley.edu

Rajeev Alur, Thomas A. Henzinger

claim paper

Read More »