scientific article; zbMATH DE number 2086614

MaRDI QIDQ4737148zbMATH OpenFDO

Authors Thomas Colcombet

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800098.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On infinite transition graphs having a decidable monadic theory
• scientific article; zbMATH DE number 2102748
• First-order logic with reachability predicates on infinite systems
• On Rational Trees
• scientific article; zbMATH DE number 4049098

Cited in

(12)

• Families of automata characterizing context-sensitive languages
• Rewriting higher-order stack trees
• The limits of decidability for first order logic on CPDA graphs
• First-order logic with reachability predicates on infinite systems
• First-order Definable Retraction Problems for Posets and Reflexive Graphs
• On Rational Trees
• Shuffled languages -- representation and recognition
• scientific article; zbMATH DE number 2038741 (Why is no real title available?)
• scientific article; zbMATH DE number 2102748 (Why is no real title available?)
• The first-order theory of ground tree rewrite graphs
• Automated Reasoning with Analytic Tableaux and Related Methods
• First-order Logic with Connectivity Operators

This page was built for publication:

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