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
2
search results - page 1 / 1
»
The Simplest Language Where Equivalence of Finite Substituti...
Sort
relevance
views
votes
recent
update
View
thumb
title
17
click to vote
FCT
2007
Springer
63
views
Applied Computing
»
more
FCT 2007
»
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
14 years 1 months ago
Download
www.math.muni.cz
Michal Kunc
claim paper
Read More »
19
click to vote
IEICET
2008
67
views
more
IEICET 2008
»
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
13 years 7 months ago
Download
colus.i.kyushu-u.ac.jp
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »