scientific article; zbMATH DE number 1956522

MaRDI QIDQ4417868zbMATH OpenFDO

Authors D. Lugiez

Publication date 30 July 2003

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Multitree automata that count
• Counting in trees
• Decidable classes of tree automata mixing local and global constraints modulo flat theories
• Unranked Tree Automata with Sibling Equalities and Disequalities
• Automata on infinite trees with counting constraints

Cited in

(8)

• Multitree automata that count
• Alternating two-way AC-tree automata
• Tree automata with equality constraints modulo equational theories
• On symbolic verification of weakly extended PAD
• Counting in trees
• Automata on infinite trees with counting constraints
• On the reachability problem for two-dimensional branching VASS
• Bridging the gap between plain VASS and branching VASS

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 Q4417868)