223 search results - page 1 / 45 » Construction of Tree Automata from Regular Expressions |
74
Voted
DLT
2008
15 years 11 days 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
15 years 10 hour 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...
84
Voted
ICTAC
2009
Springer
15 years 5 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...
91
Voted
WIA
2005
Springer
15 years 4 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...
76
Voted
FROCOS
2007
Springer
15 years 5 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:...