Electronic Communications of the EASST 2011
DOI: 10.14279/tuj.eceasst.41.580.612
|View full text |Cite
|
Sign up to set email alerts
|

Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2012
2012
2013
2013

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 6 publications
0
0
0
Order By: Relevance