Register
Dark Mode

decidability

in Theory of Computation
1,007 views
3 votes
3 votes
Is equality problem for DCFL is decidable if yes then how to prove?
in Theory of Computation
by
1.0k views

1 comment

by

It is a decidable problem but it is not so easy to prove
http://www.lfcs.inf.ed.ac.uk/reports/99/ECS-LFCS-99-411/ECS-LFCS-99-411.pdf

1
1

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
3
Na462 asked in Theory of Computation Jan 21, 2019
757 views
Reducible language ( Decidability)
Na462 asked in Theory of Computation Jan 21, 2019
by Na462
757 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!