223 search results - page 1 / 45 » Construction of Tree Automata from Regular Expressions |
DLT
2008
13 years 6 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
ICTAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
WIA
2005
Springer
13 years 10 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...