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
305
search results - page 3 / 61
»
Decidability of Split Equivalence
Sort
relevance
views
votes
recent
update
View
thumb
title
100
click to vote
ICALP
1997
Springer
84
views
Programming Languages
»
more
ICALP 1997
»
Bisimulation Equivalence is Decidable for One-Counter Processes
15 years 8 months ago
Download
www.fi.muni.cz
Petr Jancar
claim paper
Read More »
98
click to vote
CONCUR
1992
Springer
101
views
Distributed And Parallel Com...
»
more
CONCUR 1992
»
Bisimulation Equivalence is Decidable for all Context-Free Processes
15 years 7 months ago
Download
homepages.inf.ed.ac.uk
Søren Christensen, Hans Hüttel, Colin ...
claim paper
Read More »
96
click to vote
DLT
2008
108
views
Theoretical Computer Science
»
more
DLT 2008
»
On the Decidability of the Equivalence for k-Valued Transducers
15 years 5 months ago
Download
www.infres.enst.fr
Rodrigo de Souza
claim paper
Read More »
99
click to vote
ITA
2000
76
views
Communications
»
more
ITA 2000
»
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
15 years 3 months ago
Download
lvk.cs.msu.su
Vladimir A. Zakharov
claim paper
Read More »
134
Voted
CALCO
2005
Springer
76
views
Mathematics
»
more
CALCO 2005
»
Strong Splitting Bisimulation Equivalence
15 years 9 months ago
Download
alexandria.tue.nl
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
Jan A. Bergstra, C. A. Middelburg
claim paper
Read More »
« Prev
« First
page 3 / 61
Last »
Next »