Rewriting preserving recognizability of finite tree languages (English)
- New search for: Vagvolgyi, S.
- New search for: Vagvolgyi, S.
In:
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
;
82
, 2
;
71-94
;
2013
-
ISSN:
- Article (Journal) / Print
-
Title:Rewriting preserving recognizability of finite tree languages
-
Contributors:Vagvolgyi, S. ( author )
-
Published in:JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING ; 82, 2 ; 71-94
-
Publisher:
- New search for: Elsevier Science B.V., Amsterdam.
-
Publication date:2013-01-01
-
Size:24 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 005.115
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 005.115 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 82, Issue 2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 71
-
Rewriting preserving recognizability of finite tree languagesVágvölgyi, Sándor et al. | 2013
- 95
-
ITL semantics of composite Petri netsDuan, Zhenhua et al. | 2013
-
Contents| 2013
-
Editorial Board| 2013