Recognizable Infinite Tree Sets and their Complexity. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/fsttcs/Saoudi90>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Abdellatif_Saoudi>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F3-540-53487-3%5F37>
foaf:homepage	<https://doi.org/10.1007/3-540-53487-3_37>
dc:identifier	DBLP conf/fsttcs/Saoudi90 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F3-540-53487-3%5F37 (xsd:string)
dcterms:issued	1990 (xsd:gYear)
rdfs:label	Recognizable Infinite Tree Sets and their Complexity. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Abdellatif_Saoudi>
swrc:pages	91-103 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/fsttcs/1990>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/fsttcs/Saoudi90/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/fsttcs/Saoudi90>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs90.html#Saoudi90>
rdfs:seeAlso	<https://doi.org/10.1007/3-540-53487-3_37>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/fsttcs>
dc:subject	Tree automata; Büchi automata; Muller automata; and Rabin automata (xsd:string)
dc:title	Recognizable Infinite Tree Sets and their Complexity. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document