On the syntactic complexity of tree series

DOI10.1051/ITA/2010014MaRDI QIDQ3566351zbMATH OpenOpenAlexFDO

Authors Symeon Bozapalidis, Antonios Kalampakas

Publication date 7 June 2010

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2010__44_2_257_0/, https://eudml.org/doc/44621

zbMATH Keywords

recognizabilitysyntactic complexitytree series

Mathematics Subject Classification ID

General topics in the theory of computing (68Q01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Recommendations

• On the Complexity of the Syntax of Tree Languages
• Finitely presentable tree series
• Effective construction of the syntactic algebra of a recognizable series on trees
• Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series)
• On the topological complexity of tree languages

Cites work

• Effective construction of the syntactic algebra of a recognizable series on trees
• On the Complexity of the Syntax of Tree Languages
• Recognizability of graph and pattern languages
• Recognizable formal power series on trees
• Représentations matricielles des séries d'arbre reconnaissables
• The rank of a formal tree power series
• The Syntactic Complexity of Eulerian Graphs

Cited in

(3)

• The Syntactic Complexity of Eulerian Graphs
• On the Complexity of the Syntax of Tree Languages
• Varieties of recognizable tree series over fields

This page was built for publication: On the syntactic complexity of tree series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566351)