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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Boundedness of Monadic Second-Order Formulae over Finite Wor...
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
MFCS
1998
Springer
98
views
Theoretical Computer Science
»
more
MFCS 1998
»
Facial Circuits of Planar Graphs and Context-Free Languages
13 years 11 months ago
Download
www.labri.fr
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »