STACS 2005
From MaRDI portal
Publication:5710686
DOI10.1007/b106485zbMath1118.03314OpenAlexW4230940848MaRDI QIDQ5710686
Michael Benedikt, Luc Segoufin
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items (10)
Axiomatizing the equational theory of regular tree languages ⋮ A note on the characterization of TL [EF] ⋮ Algebra for Infinite Forests with an Application to the Temporal Logic EF ⋮ Automata for XML -- a survey ⋮ Aural pattern recognition experiments and the subregular hierarchy ⋮ Characterization of Logics over Ranked Tree Languages ⋮ Algebraic recognizability of regular tree languages ⋮ Characterizing EF and EX tree logics ⋮ Games for Temporal Logics on Trees ⋮ Weak Separation Problem for Tree Languages
This page was built for publication: STACS 2005
