Sciweavers

223 search results - page 23 / 45
» Construction of Tree Automata from Regular Expressions
Sort
View
FUIN
2010
83views more  FUIN 2010»
13 years 4 months ago
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
Vince Bárány, Lukasz Kaiser, Alexand...
PAMI
2002
86views more  PAMI 2002»
13 years 7 months ago
Recognizing Mathematical Expressions Using Tree Transformation
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
ICIP
2002
IEEE
14 years 9 months ago
Extraction of semantic objects from still images
In this work, we study the extraction of semantic objects from still images. We combine different ideas to extract them in a structured manner together with a perceptual metric th...
Alvaro Pardo
ACL
1998
13 years 9 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
VMCAI
2007
Springer
14 years 1 months ago
Lattice Automata
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
Orna Kupferman, Yoad Lustig