Sciweavers

762 search results - page 1 / 153
» Intercode Regular Languages
Sort
View
FUIN
2007
133views more  FUIN 2007»
13 years 11 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
COLING
1996
14 years 7 days ago
A Corpus Study of Negative Imperatives in Natural Language Instructions
In this paper, we define the notion of a preventative expression and discuss a corpus study of such expressions in instructional text. We discuss our coding schema, which takes in...
Keith Vander Linden, Barbara Di Eugenio
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 5 months ago
Isomorphism of regular trees and words
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...
Markus Lohrey, Christian Mathissen
CAI
2009
Springer
13 years 8 months ago
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...
Bo Cui, Lila Kari, Shinnosuke Seki
LREC
2008
120views Education» more  LREC 2008»
14 years 10 days ago
Language Resources for Studying Argument
This paper describes the development of a written corpus of argumentative reasoning. Arguments in the corpus have been analysed using state of the art techniques from argumentatio...
Chris Reed, Raquel Mochales Palau, Glenn Rowe, Mar...