Sciweavers

4666 search results - page 593 / 934
» Equations on Timed Languages
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 7 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
IANDC
2008
139views more  IANDC 2008»
15 years 6 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
JSYML
2006
79views more  JSYML 2006»
15 years 6 months ago
Local-global properties of positive primitive formulas in the theory of spaces of orderings
f spaces of signs (abstract real spectra) developed in [1] [18]. We consider pp (positive primitive) formulas in the language of reduced special groups as in [20]. We denote the pp...
M. Marshall
FUIN
2007
138views more  FUIN 2007»
15 years 6 months ago
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
Roman R. Redziejowski
ACTA
2002
108views more  ACTA 2002»
15 years 6 months ago
Object type constructors
Object type constructors have been introduced as an approach to adding container object types to a language with type inference. Useful subtyping for object type constructors requ...
Dominic Duggan