217 search results - page 7 / 44 » Circuit Complexity of Regular Languages |
FUIN
2008
13 years 7 months ago
2008
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
ASPDAC
2001
ACM
13 years 11 months ago
2001
ACM
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
ICDT
2003
ACM
14 years 21 days ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...