Nested Pebbles and Transitive Closure

DOI10.1007/11672142_39MaRDI QIDQ5449823zbMATH OpenOpenAlexFDO

Authors Hendrik Jan Hoogeboom, Joost Engelfriet

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
• Pebble weighted automata and transitive closure logics
• Transitive closure and betweenness relations
• Clôture transitive et reconstruction
• Nested satisfiability
• Nestings of T–Conorms
• On the power of deterministic transitive closures
• scientific article; zbMATH DE number 408795
• Transitive-closure spanners

Cited in

(4)

• Verification of agent navigation in partially-known environments
• Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
• scientific article; zbMATH DE number 408785 (Why is no real title available?)
• Logical Foundations of XML and XQuery

This page was built for publication: Nested Pebbles and Transitive Closure

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