Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
759
search results - page 9 / 152
»
Overlap-Free Regular Languages
Sort
relevance
views
votes
recent
update
View
thumb
title
87
click to vote
WIA
2007
Springer
86
views
Artificial Intelligence
»
more
WIA 2007
»
Efficient Enumeration of Regular Languages
15 years 9 months ago
Download
www.cs.uwaterloo.ca
Margareta Ackerman, Jeffrey Shallit
claim paper
Read More »
91
click to vote
TACAS
2005
Springer
105
views
Algorithms
»
more
TACAS 2005
»
Using Language Inference to Verify Omega-Regular Properties
15 years 8 months ago
Download
osl.cs.uiuc.edu
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...
claim paper
Read More »
117
click to vote
STACS
2001
Springer
88
views
Theoretical Computer Science
»
more
STACS 2001
»
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
15 years 7 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 »
83
click to vote
FOCS
1999
IEEE
89
views
Theoretical Computer Science
»
more
FOCS 1999
»
Regular Languages Are Testable with a Constant Number of Queries
15 years 7 months ago
Download
www.cs.tau.ac.il
Noga Alon, Michael Krivelevich, Ilan Newman, Mario...
claim paper
Read More »
86
click to vote
JUCS
2002
93
views
more
JUCS 2002
»
Shuffle Decomposition of Regular Languages
15 years 2 months ago
Download
www.jucs.org
Masami Ito
claim paper
Read More »
« Prev
« First
page 9 / 152
Last »
Next »