Sciweavers

759 search results - page 9 / 152
» Overlap-Free Regular Languages
Sort
View
WIA
2007
Springer
14 years 2 months ago
Efficient Enumeration of Regular Languages
Margareta Ackerman, Jeffrey Shallit
TACAS
2005
Springer
105views Algorithms» more  TACAS 2005»
14 years 1 months ago
Using Language Inference to Verify Omega-Regular Properties
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...
STACS
2001
Springer
14 years 26 days 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
FOCS
1999
IEEE
14 years 22 days ago
Regular Languages Are Testable with a Constant Number of Queries
Noga Alon, Michael Krivelevich, Ilan Newman, Mario...