Sciweavers

1052 search results - page 48 / 211
» The Regular Real-Time Languages
Sort
View
91
Voted
WIA
2007
Springer
15 years 9 months ago
Efficient Enumeration of Regular Languages
Margareta Ackerman, Jeffrey Shallit
96
Voted
TACAS
2005
Springer
105views Algorithms» more  TACAS 2005»
15 years 9 months ago
Using Language Inference to Verify Omega-Regular Properties
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...
122
Voted
STACS
2001
Springer
15 years 8 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
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
89
Voted
FOCS
1999
IEEE
15 years 7 months ago
Regular Languages Are Testable with a Constant Number of Queries
Noga Alon, Michael Krivelevich, Ilan Newman, Mario...
133
Voted
CTRS
1992
15 years 7 months ago
Decidability of Regularity and Related Properties of Ground Normal Form Languages
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