Skip to content
Book Bag:
0
items
(Full)
Login
Language
English
Slovak
Catalog
Catalog Books
Articles
Catalog ONDV
Catalog OND
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced
On the logical definability of...
Cite this
Print
Export Record
Export to MARC
Export to BibTeX
Export to Jednoduchý textový výpis
Export to ISBD (text)
Export to Citácia ISO 690 (HTML)
Export to Citácia ISO 690 (.doc)
Add to Book Bag
Remove from Book Bag
Permanent link
On the logical definability of topologically closed recognizable languages of infinite trees
Bibliographic Details
Main Authors:
Janin, David
(Author)
,
Lenzi, Giacomo, 1965-
(Author)
Format:
Article
Language:
Slovak
English
PhysicalDescription:
Fotogr.
ISSN:
1335-9150
Subjects:
grafy
>
stromy
>
topológia
>
jazyky
programovacie jazyky
články z novín a časopisov
Pozri predplatné
Predplatné
Kliknite na „Pozri predplatné“.
Holdings
Description
Similar Items
Staff View
Similar Items
Closure properties of the family of languages defined by systolic tree automata
by: Pardubská, Dana
Candela - A Topology Description Language
by: Kuchen, Herbert, et al.
Languages defined by distance constraints
by: Tuza, Zsolt
Computing with logic. Logic programming with Prolog
by: Móri, Imrich, et al.
Programming language translation. A practical approach
by: Križan, Kazimír, et al.
