Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Reachability Problem for Weak Multi-Pushdown Automata

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2013
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186637361152
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:6316
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2013
publishDateSort 2013
record_format rss_article
spellingShingle Reachability Problem for Weak Multi-Pushdown Automata
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Reachability Problem for Weak Multi-Pushdown Automata
title_auth Reachability Problem for Weak Multi-Pushdown Automata
title_full Reachability Problem for Weak Multi-Pushdown Automata
title_fullStr Reachability Problem for Weak Multi-Pushdown Automata
title_full_unstemmed Reachability Problem for Weak Multi-Pushdown Automata
title_short Reachability Problem for Weak Multi-Pushdown Automata
title_sort reachability problem for weak multi-pushdown automata
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-9(3:13)2013