206 search results - page 26 / 42 » Regular Expressions into Finite Automata |
DIAGRAMS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
CUZA
2010
13 years 4 months ago
2010
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
DLT
2010
13 years 8 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
PLANX
2007
13 years 8 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...