Rigid Tree Automata (Q3618602)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rigid Tree Automata	scientific article

Statements

scholarly article

0 references

Rigid Tree Automata (English)

0 references

Florent Jacquemard

0 references

0 references

0 references

Language and Automata Theory and Applications

0 references

publication date

2 April 2009

0 references

full work available at URL

https://hal.inria.fr/inria-00579001/file/RTA.pdf

0 references

MaRDI profile type

MaRDI publication profile

0 references

Automata for reduction properties solving

0 references

Tree automata with one memory set constraints and cryptographic protocols

0 references

Tree Automata with Global Constraints

0 references

Term Rewriting and Applications

0 references

0 references

Mobile values, new names, and secure communication

0 references

Tree automata with equality constraints modulo equational theories

0 references

Rigid tree automata and applications

0 references

Satisfiability of a Spatial Logic with Tree Variables

0 references

Closure properties and decision problems of dag automata

0 references

Haskell overloading is DEXPTIME-complete

0 references

Visibly pushdown languages

0 references

Visibly Pushdown Languages and Term Rewriting

0 references

Tree Automata with Memory, Visibility and Structural Constraints

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-00982-2_38

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3618602

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3618602&oldid=35101520"