Full Text Available

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

Alternating register automata on finite words and trees

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2012
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186527260675
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:6437
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2012
publishDateSort 2012
record_format rss_article
spellingShingle Alternating register automata on finite words and trees
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 Alternating register automata on finite words and trees
title_auth Alternating register automata on finite words and trees
title_full Alternating register automata on finite words and trees
title_fullStr Alternating register automata on finite words and trees
title_full_unstemmed Alternating register automata on finite words and trees
title_short Alternating register automata on finite words and trees
title_sort alternating register automata on finite words and trees
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-8(1:22)2012