217 search results - page 2 / 44 » Circuit Complexity of Regular Languages |
CSR
2008
Springer
13 years 6 months ago
2008
Springer
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
Hydra is a computer hardware description language that integrates several kinds of software tool (simulation, netlist generation and timing analysis) within a single circuit speci...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...