Sciweavers

759 search results - page 39 / 152
» Odometers on Regular Languages
Sort
View
ICALP
2007
Springer
15 years 4 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
VLSISP
2008
140views more  VLSISP 2008»
14 years 10 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....
MFCS
2004
Springer
15 years 3 months ago
The Dual of Concatenation
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
Alexander Okhotin
EACL
2003
ACL Anthology
14 years 11 months ago
Development of Corpora within the CLaRK System: The BulTreeBank Project Experience
CLaRK is an XML-based software system for corpora development. It incorporates several technologies: XML technology; Unicode; Regular Cascaded Grammars; Constraints over XML Docum...
Kiril Ivanov Simov, Alexander Simov, Milen Kouylek...
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
14 years 11 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith