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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
11
click to vote
ITA
2000
favorite
Email
discuss
report
76
views
Communications
»
more
ITA 2000
»
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
13 years 4 months ago
Download
lvk.cs.msu.su
Vladimir A. Zakharov
Real-time Traffic
Communications
|
ITA 2000
|
claim paper
Related Content
»
On the Decidability of Containment of Recursive Datalog Queries Preliminary report
»
Some Positive Results for Boundedness of Multiple Recursive Rules
»
Decidable Cases of Firstorder Temporal Logic with Functions
»
Idealized Algol with Ground Recursion and DPDA Equivalence
»
Structured Document Transformations Based on XSL
»
Composing monads using coproducts
»
Boundedness of Monadic SecondOrder Formulae over Finite Words
»
The Boundedness Problem for Monadic Universal FirstOrder Logic
»
Boundedness of Monadic FO over Acyclic Structures
more »
Post Info
More Details (n/a)
Added
18 Dec 2010
Updated
18 Dec 2010
Type
Journal
Year
2000
Where
ITA
Authors
Vladimir A. Zakharov
Comments
(0)
Researcher Info
Communications Study Group
Computer Vision